./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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_b7758150-3e75-4680-83e7-4a4dcb380dea/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-aa41828 [2018-11-22 21:41:39,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:41:39,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:41:39,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:41:39,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:41:39,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:41:39,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:41:39,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:41:39,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:41:39,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:41:39,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:41:39,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:41:39,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:41:39,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:41:39,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:41:39,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:41:39,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:41:39,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:41:39,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:41:39,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:41:39,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:41:40,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:41:40,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:41:40,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:41:40,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:41:40,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:41:40,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:41:40,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:41:40,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:41:40,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:41:40,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:41:40,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:41:40,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:41:40,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:41:40,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:41:40,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:41:40,006 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 21:41:40,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:41:40,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:41:40,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:41:40,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:41:40,015 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:41:40,016 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:41:40,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:41:40,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:41:40,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:41:40,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:41:40,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:41:40,018 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:41:40,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:41:40,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:41:40,018 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:41:40,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:41:40,019 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_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:40,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:41:40,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:41:40,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:41:40,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:41:40,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:41:40,056 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:41:40,102 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/data/65982c672/9ca719799d454504940de1b36b8aced9/FLAGfa476e259 [2018-11-22 21:41:40,439 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:41:40,440 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:41:40,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/data/65982c672/9ca719799d454504940de1b36b8aced9/FLAGfa476e259 [2018-11-22 21:41:40,456 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/bin-2019/uautomizer/data/65982c672/9ca719799d454504940de1b36b8aced9 [2018-11-22 21:41:40,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:41:40,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:41:40,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:40,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:41:40,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:41:40,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40, skipping insertion in model container [2018-11-22 21:41:40,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:41:40,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:41:40,684 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:40,692 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:41:40,766 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:40,797 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:41:40,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40 WrapperNode [2018-11-22 21:41:40,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:40,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:40,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:41:40,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:41:40,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:40,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:41:40,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:41:40,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:41:40,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... [2018-11-22 21:41:40,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:41:40,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:41:40,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:41:40,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:41:40,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:41:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:41:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:41:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:41:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:41:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:41:41,141 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:41:41,141 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-22 21:41:41,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:41 BoogieIcfgContainer [2018-11-22 21:41:41,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:41:41,142 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:41:41,142 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:41:41,145 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:41:41,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:41:41,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:41:40" (1/3) ... [2018-11-22 21:41:41,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f425f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:41:41, skipping insertion in model container [2018-11-22 21:41:41,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:41:41,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:40" (2/3) ... [2018-11-22 21:41:41,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f425f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:41:41, skipping insertion in model container [2018-11-22 21:41:41,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:41:41,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:41" (3/3) ... [2018-11-22 21:41:41,149 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:41:41,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:41:41,197 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:41:41,197 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:41:41,197 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:41:41,197 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:41:41,197 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:41:41,197 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:41:41,197 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:41:41,197 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:41:41,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-22 21:41:41,229 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-22 21:41:41,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:41,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:41,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 21:41:41,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:41:41,235 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:41:41,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-22 21:41:41,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-22 21:41:41,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:41,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:41,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 21:41:41,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:41:41,245 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true 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; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8#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;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; 16#L545-3true [2018-11-22 21:41:41,245 INFO L796 eck$LassoCheckResult]: Loop: 16#L545-3true 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); 13#L545-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16#L545-3true [2018-11-22 21:41:41,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-22 21:41:41,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:41,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2018-11-22 21:41:41,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:41,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:41,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2018-11-22 21:41:41,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:41,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:41,687 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:41:41,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:41:41,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:41:41,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:41:41,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:41:41,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:41:41,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:41:41,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:41:41,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-22 21:41:41,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:41:41,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:41:41,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,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-22 21:41:41,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-22 21:41:41,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,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-22 21:41:41,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-22 21:41:41,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,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-22 21:41:41,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-22 21:41:41,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:41,969 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-22 21:41:42,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:42,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-22 21:41:42,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:41:42,300 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:41:42,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:42,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:42,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:42,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:42,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:42,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:42,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:42,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:42,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:42,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:42,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:42,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:42,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:42,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:42,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:42,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:42,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:42,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:42,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:42,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:41:42,478 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 21:41:42,478 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 21:41:42,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:41:42,482 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:41:42,482 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:41:42,483 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-22 21:41:42,523 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-22 21:41:42,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:42,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:42,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:42,598 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-22 21:41:42,613 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-22 21:41:42,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-11-22 21:41:42,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2018-11-22 21:41:42,658 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-22 21:41:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:41:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-22 21:41:42,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-22 21:41:42,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:42,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-22 21:41:42,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:42,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-22 21:41:42,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:42,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2018-11-22 21:41:42,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-22 21:41:42,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2018-11-22 21:41:42,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-22 21:41:42,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 21:41:42,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2018-11-22 21:41:42,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:41:42,674 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-22 21:41:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2018-11-22 21:41:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 21:41:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 21:41:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-22 21:41:42,699 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-22 21:41:42,699 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-22 21:41:42,699 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:41:42,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2018-11-22 21:41:42,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-22 21:41:42,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:42,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:42,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:41:42,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:41:42,701 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 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; 175#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 176#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;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; 180#L545-3 assume !(lis_~i~0 < lis_~N); 188#L545-4 lis_~i~0 := 1; 183#L547-3 [2018-11-22 21:41:42,701 INFO L796 eck$LassoCheckResult]: Loop: 183#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 179#L548-3 assume !(lis_~j~0 < lis_~i~0); 181#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 183#L547-3 [2018-11-22 21:41:42,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2018-11-22 21:41:42,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:42,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:42,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:42,748 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-22 21:41:42,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:42,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:41:42,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:41:42,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2018-11-22 21:41:42,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:42,776 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:41:42,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:41:42,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:41:42,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:41:42,777 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 21:41:42,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:41:42,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:41:42,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:41:42,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-22 21:41:42,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:41:42,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:41:42,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:42,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-22 21:41:42,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:41:42,829 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:42,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 21:41:42,834 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:42,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 21:41:42,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 21:41:42,967 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 21:41:42,969 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:41:42,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:41:42,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:41:42,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:41:42,969 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:41:42,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:41:42,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:41:42,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:41:42,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-22 21:41:42,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:41:42,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:41:42,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:42,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:43,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:41:43,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:41:43,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:43,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:43,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:43,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:43,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:43,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:43,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:43,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:43,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:41:43,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:41:43,007 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 21:41:43,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:41:43,008 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:41:43,008 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:41:43,008 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-22 21:41:43,008 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 21:41:43,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:43,073 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-22 21:41:43,074 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-22 21:41:43,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-22 21:41:43,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 49 states and 84 transitions. Complement of second has 10 states. [2018-11-22 21:41:43,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:41:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 21:41:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-22 21:41:43,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-22 21:41:43,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:43,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-22 21:41:43,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:43,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-22 21:41:43,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:43,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2018-11-22 21:41:43,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-22 21:41:43,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2018-11-22 21:41:43,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-22 21:41:43,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-22 21:41:43,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2018-11-22 21:41:43,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:43,168 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2018-11-22 21:41:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2018-11-22 21:41:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-22 21:41:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 21:41:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-11-22 21:41:43,170 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-11-22 21:41:43,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:41:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:41:43,173 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-11-22 21:41:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:43,202 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2018-11-22 21:41:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:41:43,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2018-11-22 21:41:43,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:43,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2018-11-22 21:41:43,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 21:41:43,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-22 21:41:43,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-11-22 21:41:43,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:43,205 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-22 21:41:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-11-22 21:41:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-22 21:41:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 21:41:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-11-22 21:41:43,207 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-22 21:41:43,207 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-22 21:41:43,208 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:41:43,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2018-11-22 21:41:43,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:43,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:43,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:43,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:43,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:43,209 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 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; 360#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 361#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;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; 368#L545-3 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); 378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 379#L545-3 assume !(lis_~i~0 < lis_~N); 381#L545-4 lis_~i~0 := 1; 384#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-11-22 21:41:43,210 INFO L796 eck$LassoCheckResult]: Loop: 369#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 370#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; 362#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 363#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 366#L548-3 assume !(lis_~j~0 < lis_~i~0); 373#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 374#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 369#L548-3 [2018-11-22 21:41:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2018-11-22 21:41:43,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:43,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:43,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:43,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:43,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:41:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-22 21:41:43,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:41:43,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2018-11-22 21:41:43,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:43,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:43,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:43,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,459 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-22 21:41:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:41:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:41:43,518 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-22 21:41:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:43,612 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2018-11-22 21:41:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:41:43,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2018-11-22 21:41:43,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-22 21:41:43,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2018-11-22 21:41:43,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 21:41:43,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 21:41:43,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2018-11-22 21:41:43,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:43,613 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2018-11-22 21:41:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2018-11-22 21:41:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-11-22 21:41:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-22 21:41:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-22 21:41:43,616 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-22 21:41:43,616 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-22 21:41:43,616 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:41:43,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-22 21:41:43,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:43,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:43,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:43,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:43,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:43,617 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 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; 487#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 488#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;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; 495#L545-3 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); 506#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 507#L545-3 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); 510#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 514#L545-3 assume !(lis_~i~0 < lis_~N); 513#L545-4 lis_~i~0 := 1; 505#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-11-22 21:41:43,617 INFO L796 eck$LassoCheckResult]: Loop: 496#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 497#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; 489#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 490#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 493#L548-3 assume !(lis_~j~0 < lis_~i~0); 501#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 502#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 496#L548-3 [2018-11-22 21:41:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2018-11-22 21:41:43,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2018-11-22 21:41:43,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:43,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:43,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2018-11-22 21:41:43,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:43,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:43,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:43,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:43,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:41:43,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:41:43,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-22 21:41:43,988 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-11-22 21:41:44,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:41:44,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:41:44,025 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2018-11-22 21:41:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:44,176 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2018-11-22 21:41:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 21:41:44,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2018-11-22 21:41:44,178 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2018-11-22 21:41:44,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2018-11-22 21:41:44,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-22 21:41:44,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-22 21:41:44,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2018-11-22 21:41:44,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:44,180 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2018-11-22 21:41:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2018-11-22 21:41:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2018-11-22 21:41:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 21:41:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-22 21:41:44,182 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-22 21:41:44,182 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-22 21:41:44,182 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 21:41:44,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-22 21:41:44,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-22 21:41:44,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:44,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:44,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:44,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:41:44,184 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 732#L-1 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; 710#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 711#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;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; 719#L545-3 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); 733#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 734#L545-3 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); 735#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 744#L545-3 assume !(lis_~i~0 < lis_~N); 738#L545-4 lis_~i~0 := 1; 727#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 717#L548-3 [2018-11-22 21:41:44,184 INFO L796 eck$LassoCheckResult]: Loop: 717#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 746#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; 745#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 716#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 717#L548-3 [2018-11-22 21:41:44,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2018-11-22 21:41:44,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:44,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2018-11-22 21:41:44,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:44,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2018-11-22 21:41:44,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:44,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:44,367 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-22 21:41:44,639 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2018-11-22 21:41:44,727 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:41:44,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:41:44,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:41:44,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:41:44,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:41:44,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:41:44,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:41:44,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:41:44,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-22 21:41:44,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:41:44,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:41:44,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,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-22 21:41:44,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,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-22 21:41:44,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-22 21:41:44,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-22 21:41:44,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-22 21:41:44,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-22 21:41:44,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,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-22 21:41:44,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-22 21:41:44,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,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-22 21:41:44,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-22 21:41:44,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:44,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:45,097 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-22 21:41:45,246 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-22 21:41:45,426 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-22 21:41:45,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:41:45,685 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:41:45,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,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-22 21:41:45,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,739 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:41:45,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:41:45,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:45,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:45,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:45,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,759 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:41:45,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,760 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:41:45,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:45,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:45,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:45,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:45,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:45,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:45,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:45,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:45,795 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:41:45,844 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 21:41:45,844 INFO L444 ModelExtractionUtils]: 55 out of 64 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 21:41:45,844 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:41:45,845 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:41:45,845 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:41:45,845 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-22 21:41:45,999 INFO L297 tatePredicateManager]: 43 out of 43 supporting invariants were superfluous and have been removed [2018-11-22 21:41:46,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:46,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:46,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:46,027 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-22 21:41:46,027 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-22 21:41:46,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-22 21:41:46,042 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 65 states and 98 transitions. Complement of second has 7 states. [2018-11-22 21:41:46,043 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-22 21:41:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:41:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 21:41:46,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 21:41:46,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:46,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 21:41:46,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:46,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-22 21:41:46,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:46,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2018-11-22 21:41:46,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:46,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2018-11-22 21:41:46,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 21:41:46,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 21:41:46,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2018-11-22 21:41:46,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:46,046 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-11-22 21:41:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2018-11-22 21:41:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-22 21:41:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 21:41:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-11-22 21:41:46,048 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-22 21:41:46,049 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-22 21:41:46,049 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 21:41:46,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2018-11-22 21:41:46,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:46,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:46,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:46,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:46,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:46,050 INFO L794 eck$LassoCheckResult]: Stem: 1078#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1076#L-1 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; 1055#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1056#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;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; 1063#L545-3 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); 1074#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1075#L545-3 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); 1077#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1087#L545-3 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); 1085#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1084#L545-3 assume !(lis_~i~0 < lis_~N); 1080#L545-4 lis_~i~0 := 1; 1070#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1071#L548-3 assume !(lis_~j~0 < lis_~i~0); 1068#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1069#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1086#L548-3 [2018-11-22 21:41:46,050 INFO L796 eck$LassoCheckResult]: Loop: 1086#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1081#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; 1057#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1058#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1061#L548-3 assume !(lis_~j~0 < lis_~i~0); 1066#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1067#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1086#L548-3 [2018-11-22 21:41:46,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2018-11-22 21:41:46,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 21:41:46,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:46,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:41:46,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:41:46,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2018-11-22 21:41:46,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,239 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-22 21:41:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:41:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:41:46,285 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-22 21:41:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:46,312 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2018-11-22 21:41:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:41:46,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2018-11-22 21:41:46,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:46,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2018-11-22 21:41:46,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-22 21:41:46,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 21:41:46,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2018-11-22 21:41:46,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:46,314 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-11-22 21:41:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2018-11-22 21:41:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-11-22 21:41:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 21:41:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-22 21:41:46,316 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-22 21:41:46,316 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-22 21:41:46,316 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 21:41:46,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-22 21:41:46,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-22 21:41:46,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:46,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:46,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:46,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:46,317 INFO L794 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1174#L-1 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; 1151#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1152#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;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; 1160#L545-3 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); 1175#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1176#L545-3 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); 1171#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1172#L545-3 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); 1182#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1181#L545-3 assume !(lis_~i~0 < lis_~N); 1179#L545-4 lis_~i~0 := 1; 1169#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1161#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1162#L549 assume !lis_#t~short11; 1187#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 1158#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1159#L548-3 assume !(lis_~j~0 < lis_~i~0); 1165#L547-2 [2018-11-22 21:41:46,318 INFO L796 eck$LassoCheckResult]: Loop: 1165#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1166#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1183#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1180#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; 1153#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1154#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1157#L548-3 assume !(lis_~j~0 < lis_~i~0); 1165#L547-2 [2018-11-22 21:41:46,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2018-11-22 21:41:46,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2018-11-22 21:41:46,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:46,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2018-11-22 21:41:46,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 21:41:46,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:46,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:46,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:46,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:41:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:41:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-22 21:41:46,773 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-22 21:41:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:41:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:41:46,823 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-11-22 21:41:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:46,893 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-11-22 21:41:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:41:46,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2018-11-22 21:41:46,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-22 21:41:46,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2018-11-22 21:41:46,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-22 21:41:46,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-22 21:41:46,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2018-11-22 21:41:46,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:41:46,895 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-22 21:41:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2018-11-22 21:41:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-22 21:41:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:41:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-22 21:41:46,897 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-22 21:41:46,897 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-22 21:41:46,897 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 21:41:46,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-11-22 21:41:46,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-22 21:41:46,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:46,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:46,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:46,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-22 21:41:46,898 INFO L794 eck$LassoCheckResult]: Stem: 1362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1360#L-1 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; 1342#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1343#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;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; 1351#L545-3 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); 1358#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1359#L545-3 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); 1361#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1369#L545-3 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); 1367#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1366#L545-3 assume !(lis_~i~0 < lis_~N); 1364#L545-4 lis_~i~0 := 1; 1365#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1368#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1354#L549 assume !lis_#t~short11; 1346#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 1347#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1350#L548-3 assume !(lis_~j~0 < lis_~i~0); 1353#L547-2 [2018-11-22 21:41:46,898 INFO L796 eck$LassoCheckResult]: Loop: 1353#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1355#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1357#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1372#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; 1371#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1348#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1349#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1352#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; 1344#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1345#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1370#L548-3 assume !(lis_~j~0 < lis_~i~0); 1353#L547-2 [2018-11-22 21:41:46,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2018-11-22 21:41:46,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2018-11-22 21:41:46,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:46,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2018-11-22 21:41:46,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:41:47,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:47,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:47,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:41:47,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:41:47,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:41:47,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:47,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,499 INFO L478 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-22 21:41:47,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,512 INFO L478 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-22 21:41:47,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,524 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-22 21:41:47,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-22 21:41:47,557 INFO L478 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-22 21:41:47,559 INFO L478 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-22 21:41:47,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,567 INFO L478 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-22 21:41:47,569 INFO L478 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-22 21:41:47,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,577 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-22 21:41:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-22 21:41:47,623 INFO L478 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-22 21:41:47,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,626 INFO L478 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-22 21:41:47,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,654 INFO L478 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-22 21:41:47,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,658 INFO L478 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-22 21:41:47,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,671 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-22 21:41:47,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-22 21:41:47,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,849 INFO L478 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-22 21:41:47,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:47,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,858 INFO L478 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-22 21:41:47,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,881 INFO L478 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-22 21:41:47,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,885 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:47,887 INFO L478 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-22 21:41:47,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:47,918 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-22 21:41:47,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2018-11-22 21:41:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:41:48,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:41:48,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-22 21:41:48,422 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-11-22 21:41:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-22 21:41:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-11-22 21:41:48,499 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 28 states. [2018-11-22 21:41:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:50,179 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-11-22 21:41:50,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-22 21:41:50,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 134 transitions. [2018-11-22 21:41:50,181 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2018-11-22 21:41:50,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 134 transitions. [2018-11-22 21:41:50,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-22 21:41:50,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-22 21:41:50,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 134 transitions. [2018-11-22 21:41:50,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:41:50,183 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 134 transitions. [2018-11-22 21:41:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 134 transitions. [2018-11-22 21:41:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2018-11-22 21:41:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-22 21:41:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-11-22 21:41:50,188 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-22 21:41:50,188 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-22 21:41:50,189 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 21:41:50,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 71 transitions. [2018-11-22 21:41:50,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-22 21:41:50,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:50,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:50,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:50,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:50,190 INFO L794 eck$LassoCheckResult]: Stem: 1668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1665#L-1 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; 1647#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1648#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;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; 1656#L545-3 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); 1666#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1667#L545-3 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); 1663#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1664#L545-3 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); 1677#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1676#L545-3 assume !(lis_~i~0 < lis_~N); 1670#L545-4 lis_~i~0 := 1; 1671#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1678#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1673#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; 1674#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1652#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1655#L548-3 assume !(lis_~j~0 < lis_~i~0); 1657#L547-2 [2018-11-22 21:41:50,190 INFO L796 eck$LassoCheckResult]: Loop: 1657#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1658#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1662#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1685#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; 1683#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 1653#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1654#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1659#L549 assume !lis_#t~short11; 1649#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 1650#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1682#L548-3 assume !(lis_~j~0 < lis_~i~0); 1657#L547-2 [2018-11-22 21:41:50,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1306550290, now seen corresponding path program 1 times [2018-11-22 21:41:50,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:50,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 371010479, now seen corresponding path program 1 times [2018-11-22 21:41:50,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:50,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2097989374, now seen corresponding path program 3 times [2018-11-22 21:41:50,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:50,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:50,470 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2018-11-22 21:41:52,254 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 225 DAG size of output: 165 [2018-11-22 21:41:52,655 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-22 21:41:52,657 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:41:52,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:41:52,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:41:52,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:41:52,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:41:52,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:41:52,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:41:52,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:41:52,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration9_Lasso [2018-11-22 21:41:52,658 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:41:52,658 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:41:52,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,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-22 21:41:52,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:52,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:53,795 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-11-22 21:41:54,231 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 115 [2018-11-22 21:41:54,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:41:54,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:41:54,610 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:41:54,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:54,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:54,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:54,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:54,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:41:54,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:41:54,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:41:54,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:54,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:54,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:54,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:54,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:41:54,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:41:54,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:41:54,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:41:54,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:41:54,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:41:54,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:41:54,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:41:54,653 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:41:54,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 21:41:54,658 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 21:41:54,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:41:54,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:41:54,659 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:41:54,659 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)_2, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 + 1 Supporting invariants [] [2018-11-22 21:41:54,903 INFO L297 tatePredicateManager]: 69 out of 70 supporting invariants were superfluous and have been removed [2018-11-22 21:41:54,905 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:41:54,906 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:41:54,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:54,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:54,935 INFO L478 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-22 21:41:54,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:54,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:54,954 INFO L478 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-22 21:41:54,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:54,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:54,959 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-22 21:41:54,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-22 21:41:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:54,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:55,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:55,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-11-22 21:41:55,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:55,007 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:55,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:55,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 71 treesize of output 129 [2018-11-22 21:41:55,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-11-22 21:41:55,073 INFO L478 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 51 treesize of output 52 [2018-11-22 21:41:55,075 INFO L478 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-22 21:41:55,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-22 21:41:55,086 INFO L478 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-22 21:41:55,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-11-22 21:41:55,100 INFO L478 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-22 21:41:55,100 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:55,124 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-22 21:41:55,144 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 3 xjuncts. [2018-11-22 21:41:55,144 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:107, output treesize:182 [2018-11-22 21:41:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:55,349 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-22 21:41:55,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23 Second operand 10 states. [2018-11-22 21:41:55,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23. Second operand 10 states. Result 122 states and 170 transitions. Complement of second has 18 states. [2018-11-22 21:41:55,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-22 21:41:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 21:41:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-22 21:41:55,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 18 letters. Loop has 11 letters. [2018-11-22 21:41:55,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 29 letters. Loop has 11 letters. [2018-11-22 21:41:55,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 18 letters. Loop has 22 letters. [2018-11-22 21:41:55,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:41:55,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 170 transitions. [2018-11-22 21:41:55,557 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2018-11-22 21:41:55,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 118 states and 163 transitions. [2018-11-22 21:41:55,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-22 21:41:55,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-22 21:41:55,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 163 transitions. [2018-11-22 21:41:55,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:41:55,559 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 163 transitions. [2018-11-22 21:41:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 163 transitions. [2018-11-22 21:41:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2018-11-22 21:41:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-22 21:41:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2018-11-22 21:41:55,562 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2018-11-22 21:41:55,562 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2018-11-22 21:41:55,562 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 21:41:55,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 124 transitions. [2018-11-22 21:41:55,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2018-11-22 21:41:55,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:41:55,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:41:55,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:55,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:41:55,564 INFO L794 eck$LassoCheckResult]: Stem: 2265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2262#L-1 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; 2239#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2240#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;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; 2248#L545-3 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); 2263#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2264#L545-3 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); 2259#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2260#L545-3 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); 2272#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2271#L545-3 assume !(lis_~i~0 < lis_~N); 2267#L545-4 lis_~i~0 := 1; 2256#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2257#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2290#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; 2287#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 2285#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2279#L548-3 assume !(lis_~j~0 < lis_~i~0); 2274#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2253#L547-3 [2018-11-22 21:41:55,564 INFO L796 eck$LassoCheckResult]: Loop: 2253#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2278#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2318#L549 assume !lis_#t~short11; 2241#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 2242#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2245#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2249#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; 2295#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 2283#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2284#L548-3 assume !(lis_~j~0 < lis_~i~0); 2252#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2253#L547-3 [2018-11-22 21:41:55,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1848353382, now seen corresponding path program 2 times [2018-11-22 21:41:55,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:55,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:55,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 269075773, now seen corresponding path program 1 times [2018-11-22 21:41:55,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:41:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:55,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 482025912, now seen corresponding path program 4 times [2018-11-22 21:41:55,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:56,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:56,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:41:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 21:41:56,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 21:41:56,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:41:56,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:56,074 INFO L478 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-22 21:41:56,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,092 INFO L478 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-22 21:41:56,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,097 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-22 21:41:56,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-22 21:41:56,125 INFO L478 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-22 21:41:56,127 INFO L478 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-22 21:41:56,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,133 INFO L478 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-22 21:41:56,135 INFO L478 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-22 21:41:56,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,142 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-22 21:41:56,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-22 21:41:56,191 INFO L478 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-22 21:41:56,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,195 INFO L478 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-22 21:41:56,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,206 INFO L478 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-22 21:41:56,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,209 INFO L478 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-22 21:41:56,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,223 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-22 21:41:56,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-22 21:41:56,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,331 INFO L478 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-22 21:41:56,336 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:56,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 96 [2018-11-22 21:41:56,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:41:56,401 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:56,402 INFO L478 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 71 [2018-11-22 21:41:56,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,405 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:56,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,406 INFO L478 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 54 [2018-11-22 21:41:56,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,422 INFO L478 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-22 21:41:56,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:41:56,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:56,426 INFO L478 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 37 treesize of output 52 [2018-11-22 21:41:56,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,451 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-22 21:41:56,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-22 21:41:56,475 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:122, output treesize:127 [2018-11-22 21:42:08,699 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-22 21:42:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:42:08,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-11-22 21:42:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-22 21:42:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-11-22 21:42:09,001 INFO L87 Difference]: Start difference. First operand 89 states and 124 transitions. cyclomatic complexity: 41 Second operand 28 states. [2018-11-22 21:42:10,215 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-22 21:42:13,191 WARN L180 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-11-22 21:42:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:13,492 INFO L93 Difference]: Finished difference Result 213 states and 290 transitions. [2018-11-22 21:42:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-22 21:42:13,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 290 transitions. [2018-11-22 21:42:13,497 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 68 [2018-11-22 21:42:13,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 211 states and 288 transitions. [2018-11-22 21:42:13,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2018-11-22 21:42:13,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2018-11-22 21:42:13,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 288 transitions. [2018-11-22 21:42:13,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:13,498 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 288 transitions. [2018-11-22 21:42:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 288 transitions. [2018-11-22 21:42:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 112. [2018-11-22 21:42:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-22 21:42:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2018-11-22 21:42:13,503 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 155 transitions. [2018-11-22 21:42:13,503 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 155 transitions. [2018-11-22 21:42:13,503 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 21:42:13,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 155 transitions. [2018-11-22 21:42:13,504 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-22 21:42:13,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:13,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:13,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:13,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:42:13,504 INFO L794 eck$LassoCheckResult]: Stem: 2731#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2728#L-1 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; 2707#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2708#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;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; 2716#L545-3 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); 2729#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2730#L545-3 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); 2726#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2727#L545-3 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); 2740#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2739#L545-3 assume !(lis_~i~0 < lis_~N); 2733#L545-4 lis_~i~0 := 1; 2734#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2752#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2751#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; 2749#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 2747#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2743#L548-3 assume !(lis_~j~0 < lis_~i~0); 2744#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2775#L547-3 assume !(lis_~i~0 < lis_~N); 2723#L547-4 lis_~i~0 := 0; 2705#L551-3 [2018-11-22 21:42:13,505 INFO L796 eck$LassoCheckResult]: Loop: 2705#L551-3 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); 2706#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; 2732#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 2705#L551-3 [2018-11-22 21:42:13,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2018-11-22 21:42:13,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:42:13,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:13,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:13,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:13,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:42:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-22 21:42:13,628 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:42:13,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:13,628 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2018-11-22 21:42:13,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:13,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:13,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 21:42:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-22 21:42:13,663 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. cyclomatic complexity: 51 Second operand 16 states. [2018-11-22 21:42:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:13,854 INFO L93 Difference]: Finished difference Result 156 states and 214 transitions. [2018-11-22 21:42:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 21:42:13,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 214 transitions. [2018-11-22 21:42:13,855 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2018-11-22 21:42:13,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 214 transitions. [2018-11-22 21:42:13,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-11-22 21:42:13,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-11-22 21:42:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 214 transitions. [2018-11-22 21:42:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:13,856 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 214 transitions. [2018-11-22 21:42:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 214 transitions. [2018-11-22 21:42:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 112. [2018-11-22 21:42:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-22 21:42:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2018-11-22 21:42:13,860 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 153 transitions. [2018-11-22 21:42:13,860 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 153 transitions. [2018-11-22 21:42:13,860 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 21:42:13,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 153 transitions. [2018-11-22 21:42:13,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-22 21:42:13,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:13,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:13,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:13,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:42:13,863 INFO L794 eck$LassoCheckResult]: Stem: 3093#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3090#L-1 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; 3068#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3069#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;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; 3077#L545-3 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); 3091#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3092#L545-3 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); 3087#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3088#L545-3 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); 3101#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3100#L545-3 assume !(lis_~i~0 < lis_~N); 3095#L545-4 lis_~i~0 := 1; 3096#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3119#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3118#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; 3115#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3114#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3112#L548-3 assume !(lis_~j~0 < lis_~i~0); 3082#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3084#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3086#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3176#L549 assume !lis_#t~short11; 3070#L549-2 [2018-11-22 21:42:13,863 INFO L796 eck$LassoCheckResult]: Loop: 3070#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3071#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3177#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3165#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; 3166#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3142#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3143#L548-3 assume !(lis_~j~0 < lis_~i~0); 3105#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3104#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3164#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3163#L549 assume !lis_#t~short11; 3070#L549-2 [2018-11-22 21:42:13,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 294939552, now seen corresponding path program 1 times [2018-11-22 21:42:13,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:42:14,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:14,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:14,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:14,147 INFO L478 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-22 21:42:14,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,180 INFO L478 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-22 21:42:14,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,186 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-22 21:42:14,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-22 21:42:14,204 INFO L478 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-22 21:42:14,207 INFO L478 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-22 21:42:14,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,215 INFO L478 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-22 21:42:14,218 INFO L478 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-22 21:42:14,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,225 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-22 21:42:14,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-22 21:42:14,274 INFO L478 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-22 21:42:14,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,279 INFO L478 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-22 21:42:14,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,296 INFO L478 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-22 21:42:14,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,305 INFO L478 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-22 21:42:14,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,332 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-22 21:42:14,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-11-22 21:42:14,408 INFO L478 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-22 21:42:14,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,417 INFO L478 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-22 21:42:14,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,441 INFO L478 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-22 21:42:14,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:14,453 INFO L478 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-22 21:42:14,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:14,475 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-22 21:42:14,484 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-22 21:42:14,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:62 [2018-11-22 21:42:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:42:14,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:14,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-22 21:42:14,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:42:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 209499593, now seen corresponding path program 2 times [2018-11-22 21:42:14,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:14,724 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2018-11-22 21:42:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-22 21:42:14,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-11-22 21:42:14,754 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. cyclomatic complexity: 49 Second operand 20 states. [2018-11-22 21:42:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:15,599 INFO L93 Difference]: Finished difference Result 206 states and 283 transitions. [2018-11-22 21:42:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 21:42:15,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 283 transitions. [2018-11-22 21:42:15,600 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 86 [2018-11-22 21:42:15,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 283 transitions. [2018-11-22 21:42:15,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-22 21:42:15,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-22 21:42:15,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 283 transitions. [2018-11-22 21:42:15,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:15,602 INFO L705 BuchiCegarLoop]: Abstraction has 206 states and 283 transitions. [2018-11-22 21:42:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 283 transitions. [2018-11-22 21:42:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 112. [2018-11-22 21:42:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-22 21:42:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2018-11-22 21:42:15,605 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 152 transitions. [2018-11-22 21:42:15,605 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 152 transitions. [2018-11-22 21:42:15,605 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 21:42:15,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 152 transitions. [2018-11-22 21:42:15,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-22 21:42:15,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:15,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:15,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:15,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-22 21:42:15,606 INFO L794 eck$LassoCheckResult]: Stem: 3530#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3527#L-1 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; 3504#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3505#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;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; 3513#L545-3 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); 3528#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3529#L545-3 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); 3524#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3525#L545-3 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); 3539#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3538#L545-3 assume !(lis_~i~0 < lis_~N); 3532#L545-4 lis_~i~0 := 1; 3533#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3554#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3553#L549 assume !lis_#t~short11; 3552#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3549#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3546#L548-3 assume !(lis_~j~0 < lis_~i~0); 3547#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3520#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3521#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3534#L549 assume !lis_#t~short11; 3536#L549-2 [2018-11-22 21:42:15,606 INFO L796 eck$LassoCheckResult]: Loop: 3536#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3599#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3585#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3584#L549 assume !lis_#t~short11; 3582#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 3578#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3579#L548-3 assume !(lis_~j~0 < lis_~i~0); 3516#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3517#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3601#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3600#L549 assume !lis_#t~short11; 3536#L549-2 [2018-11-22 21:42:15,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash -514407074, now seen corresponding path program 1 times [2018-11-22 21:42:15,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:15,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2018-11-22 21:42:15,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:15,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1760837130, now seen corresponding path program 2 times [2018-11-22 21:42:15,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 21:42:15,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:15,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:42:15,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:42:15,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:42:15,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 21:42:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-22 21:42:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 21:42:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-22 21:42:15,918 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. cyclomatic complexity: 48 Second operand 19 states. [2018-11-22 21:42:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:16,267 INFO L93 Difference]: Finished difference Result 332 states and 448 transitions. [2018-11-22 21:42:16,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-22 21:42:16,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 448 transitions. [2018-11-22 21:42:16,268 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 74 [2018-11-22 21:42:16,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 279 states and 377 transitions. [2018-11-22 21:42:16,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2018-11-22 21:42:16,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2018-11-22 21:42:16,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 377 transitions. [2018-11-22 21:42:16,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:16,270 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 377 transitions. [2018-11-22 21:42:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 377 transitions. [2018-11-22 21:42:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 151. [2018-11-22 21:42:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-22 21:42:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2018-11-22 21:42:16,275 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2018-11-22 21:42:16,275 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2018-11-22 21:42:16,275 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-22 21:42:16,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2018-11-22 21:42:16,276 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 46 [2018-11-22 21:42:16,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:16,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:16,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:16,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:42:16,276 INFO L794 eck$LassoCheckResult]: Stem: 4123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4120#L-1 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; 4096#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4097#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;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; 4106#L545-3 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); 4121#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4135#L545-3 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); 4136#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4122#L545-3 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); 4117#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4118#L545-3 assume !(lis_~i~0 < lis_~N); 4125#L545-4 lis_~i~0 := 1; 4126#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4162#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4161#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; 4158#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 4156#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4157#L548-3 assume !(lis_~j~0 < lis_~i~0); 4110#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4111#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4238#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4237#L549 assume !lis_#t~short11; 4233#L549-2 [2018-11-22 21:42:16,276 INFO L796 eck$LassoCheckResult]: Loop: 4233#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 4235#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4234#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4232#L549 assume !lis_#t~short11; 4233#L549-2 [2018-11-22 21:42:16,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2018-11-22 21:42:16,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:16,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:16,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:16,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 1 times [2018-11-22 21:42:16,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:16,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:16,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash -360466235, now seen corresponding path program 5 times [2018-11-22 21:42:16,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:16,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:18,610 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 256 DAG size of output: 186 [2018-11-22 21:42:19,537 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-22 21:42:19,540 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:42:19,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:42:19,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:42:19,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:42:19,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:42:19,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:42:19,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:42:19,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:42:19,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration14_Lasso [2018-11-22 21:42:19,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:42:19,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:42:19,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:19,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:19,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:19,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,513 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 117 [2018-11-22 21:42:20,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-22 21:42:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,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-22 21:42:20,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-22 21:42:20,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-22 21:42:20,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-22 21:42:20,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:20,792 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2018-11-22 21:42:20,976 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:42:20,976 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:42:20,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:20,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:20,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:20,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:20,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:20,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:20,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:20,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:20,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:20,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:20,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:20,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:20,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:42:20,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,989 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:42:20,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:20,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:20,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:20,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:20,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:20,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:20,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:20,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:20,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:21,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:21,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:21,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:21,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,007 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:42:21,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,008 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:42:21,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:21,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:21,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,014 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:42:21,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:42:21,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:21,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:21,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:21,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:21,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:21,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:21,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:21,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:21,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:42:21,045 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 21:42:21,046 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 21:42:21,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:42:21,046 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:42:21,047 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:42:21,047 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -4*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-22 21:42:21,371 INFO L297 tatePredicateManager]: 71 out of 73 supporting invariants were superfluous and have been removed [2018-11-22 21:42:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:21,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:21,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:21,483 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-22 21:42:21,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-22 21:42:21,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 202 transitions. cyclomatic complexity: 61 Second operand 8 states. [2018-11-22 21:42:21,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 202 transitions. cyclomatic complexity: 61. Second operand 8 states. Result 361 states and 491 transitions. Complement of second has 11 states. [2018-11-22 21:42:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:42:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-22 21:42:21,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-22 21:42:21,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:21,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-22 21:42:21,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:21,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-22 21:42:21,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:21,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 491 transitions. [2018-11-22 21:42:21,567 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 83 [2018-11-22 21:42:21,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 329 states and 446 transitions. [2018-11-22 21:42:21,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-11-22 21:42:21,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2018-11-22 21:42:21,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 446 transitions. [2018-11-22 21:42:21,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:21,568 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 446 transitions. [2018-11-22 21:42:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 446 transitions. [2018-11-22 21:42:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 243. [2018-11-22 21:42:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-22 21:42:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 336 transitions. [2018-11-22 21:42:21,571 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 336 transitions. [2018-11-22 21:42:21,571 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 336 transitions. [2018-11-22 21:42:21,571 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-22 21:42:21,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 336 transitions. [2018-11-22 21:42:21,572 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-22 21:42:21,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:21,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:21,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:21,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:42:21,573 INFO L794 eck$LassoCheckResult]: Stem: 5047#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5043#L-1 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; 5022#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5023#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;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; 5030#L545-3 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); 5044#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5059#L545-3 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); 5060#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5045#L545-3 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); 5046#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5075#L545-3 assume !(lis_~i~0 < lis_~N); 5049#L545-4 lis_~i~0 := 1; 5050#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5091#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5090#L549 assume !lis_#t~short11; 5089#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 5085#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5086#L548-3 assume !(lis_~j~0 < lis_~i~0); 5034#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5035#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5038#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5260#L549 assume !lis_#t~short11; 5248#L549-2 [2018-11-22 21:42:21,573 INFO L796 eck$LassoCheckResult]: Loop: 5248#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 5247#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5259#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5249#L549 assume !lis_#t~short11; 5248#L549-2 [2018-11-22 21:42:21,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash -514407074, now seen corresponding path program 3 times [2018-11-22 21:42:21,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:21,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 2 times [2018-11-22 21:42:21,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:21,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 598763781, now seen corresponding path program 4 times [2018-11-22 21:42:21,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:21,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:22,453 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 164 [2018-11-22 21:42:22,624 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-22 21:42:22,626 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:42:22,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:42:22,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:42:22,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:42:22,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:42:22,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:42:22,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:42:22,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:42:22,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration15_Lasso [2018-11-22 21:42:22,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:42:22,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:42:22,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:22,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:23,162 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 107 [2018-11-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,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-22 21:42:23,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:42:23,595 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:42:23,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:23,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:23,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:23,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:23,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:23,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:23,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:23,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:23,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:23,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:23,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:23,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:23,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:23,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:23,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:23,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,611 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:42:23,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:42:23,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,614 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:42:23,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,615 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:42:23,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:23,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:23,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:23,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:23,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:23,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:23,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:23,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:23,646 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:42:23,657 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 21:42:23,657 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 21:42:23,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:42:23,658 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:42:23,658 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:42:23,658 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -4*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-22 21:42:23,888 INFO L297 tatePredicateManager]: 63 out of 66 supporting invariants were superfluous and have been removed [2018-11-22 21:42:23,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:23,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:23,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:23,973 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-22 21:42:23,974 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-22 21:42:23,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112 Second operand 8 states. [2018-11-22 21:42:24,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112. Second operand 8 states. Result 353 states and 498 transitions. Complement of second has 11 states. [2018-11-22 21:42:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:42:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-22 21:42:24,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-22 21:42:24,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:24,046 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:42:24,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:24,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:24,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:24,126 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-22 21:42:24,126 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-22 21:42:24,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112 Second operand 8 states. [2018-11-22 21:42:24,229 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112. Second operand 8 states. Result 360 states and 502 transitions. Complement of second has 13 states. [2018-11-22 21:42:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:42:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2018-11-22 21:42:24,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 51 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-22 21:42:24,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:24,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:42:24,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:24,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:24,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:24,353 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-22 21:42:24,353 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-22 21:42:24,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112 Second operand 8 states. [2018-11-22 21:42:24,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 336 transitions. cyclomatic complexity: 112. Second operand 8 states. Result 430 states and 605 transitions. Complement of second has 13 states. [2018-11-22 21:42:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 21:42:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-22 21:42:24,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-22 21:42:24,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:24,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-22 21:42:24,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:24,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-22 21:42:24,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:24,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 605 transitions. [2018-11-22 21:42:24,435 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 61 [2018-11-22 21:42:24,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 360 states and 489 transitions. [2018-11-22 21:42:24,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-22 21:42:24,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-22 21:42:24,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 360 states and 489 transitions. [2018-11-22 21:42:24,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:24,438 INFO L705 BuchiCegarLoop]: Abstraction has 360 states and 489 transitions. [2018-11-22 21:42:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states and 489 transitions. [2018-11-22 21:42:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 222. [2018-11-22 21:42:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-22 21:42:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 305 transitions. [2018-11-22 21:42:24,443 INFO L728 BuchiCegarLoop]: Abstraction has 222 states and 305 transitions. [2018-11-22 21:42:24,444 INFO L608 BuchiCegarLoop]: Abstraction has 222 states and 305 transitions. [2018-11-22 21:42:24,444 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-22 21:42:24,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 305 transitions. [2018-11-22 21:42:24,445 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2018-11-22 21:42:24,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:24,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:24,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:24,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:42:24,446 INFO L794 eck$LassoCheckResult]: Stem: 7034#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7031#L-1 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; 7007#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7008#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;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; 7016#L545-3 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); 7032#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7049#L545-3 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); 7050#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7033#L545-3 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); 7029#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7030#L545-3 assume !(lis_~i~0 < lis_~N); 7045#L545-4 lis_~i~0 := 1; 7064#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7063#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7062#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; 7059#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 7057#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7058#L548-3 assume !(lis_~j~0 < lis_~i~0); 7020#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7021#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7189#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7188#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; 7187#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 7013#L548-2 [2018-11-22 21:42:24,446 INFO L796 eck$LassoCheckResult]: Loop: 7013#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7014#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7212#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; 7181#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 7013#L548-2 [2018-11-22 21:42:24,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1362538132, now seen corresponding path program 3 times [2018-11-22 21:42:24,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:24,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 2 times [2018-11-22 21:42:24,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1651343245, now seen corresponding path program 4 times [2018-11-22 21:42:24,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:24,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:24,689 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-22 21:42:28,177 WARN L180 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 291 DAG size of output: 207 [2018-11-22 21:42:29,074 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-11-22 21:42:29,077 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:42:29,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:42:29,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:42:29,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:42:29,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:42:29,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:42:29,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:42:29,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:42:29,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration16_Lasso [2018-11-22 21:42:29,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:42:29,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:42:29,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:29,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,456 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 109 [2018-11-22 21:42:30,601 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2018-11-22 21:42:30,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:42:30,770 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-11-22 21:42:31,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:42:31,040 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:42:31,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-22 21:42:31,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,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-22 21:42:31,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:42:31,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:42:31,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:42:31,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,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-22 21:42:31,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,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-22 21:42:31,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:42:31,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:42:31,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:42:31,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:42:31,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:42:31,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:42:31,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:42:31,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:42:31,096 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:42:31,127 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 21:42:31,127 INFO L444 ModelExtractionUtils]: 52 out of 61 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 21:42:31,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:42:31,128 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:42:31,128 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:42:31,128 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_4) = -16*ULTIMATE.start_lis_~j~0 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_4 Supporting invariants [] [2018-11-22 21:42:31,439 INFO L297 tatePredicateManager]: 68 out of 69 supporting invariants were superfluous and have been removed [2018-11-22 21:42:31,441 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 21:42:31,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,513 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-22 21:42:31,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-11-22 21:42:31,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98 Second operand 7 states. [2018-11-22 21:42:31,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98. Second operand 7 states. Result 442 states and 628 transitions. Complement of second has 12 states. [2018-11-22 21:42:31,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:42:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-22 21:42:31,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-22 21:42:31,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:31,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:42:31,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,679 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-22 21:42:31,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2018-11-22 21:42:31,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98 Second operand 7 states. [2018-11-22 21:42:31,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98. Second operand 7 states. Result 463 states and 642 transitions. Complement of second has 12 states. [2018-11-22 21:42:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:42:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-22 21:42:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-22 21:42:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:31,773 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:42:31,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:31,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:31,851 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-22 21:42:31,851 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-11-22 21:42:31,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98 Second operand 7 states. [2018-11-22 21:42:31,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 222 states and 305 transitions. cyclomatic complexity: 98. Second operand 7 states. Result 374 states and 524 transitions. Complement of second has 14 states. [2018-11-22 21:42:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-22 21:42:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:42:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-22 21:42:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-22 21:42:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 27 letters. Loop has 4 letters. [2018-11-22 21:42:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-22 21:42:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:42:31,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 524 transitions. [2018-11-22 21:42:31,928 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2018-11-22 21:42:31,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 318 states and 442 transitions. [2018-11-22 21:42:31,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-22 21:42:31,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-22 21:42:31,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 442 transitions. [2018-11-22 21:42:31,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:31,930 INFO L705 BuchiCegarLoop]: Abstraction has 318 states and 442 transitions. [2018-11-22 21:42:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 442 transitions. [2018-11-22 21:42:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 244. [2018-11-22 21:42:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-22 21:42:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 355 transitions. [2018-11-22 21:42:31,935 INFO L728 BuchiCegarLoop]: Abstraction has 244 states and 355 transitions. [2018-11-22 21:42:31,935 INFO L608 BuchiCegarLoop]: Abstraction has 244 states and 355 transitions. [2018-11-22 21:42:31,935 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-22 21:42:31,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 355 transitions. [2018-11-22 21:42:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-22 21:42:31,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:31,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:31,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:31,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:42:31,937 INFO L794 eck$LassoCheckResult]: Stem: 9151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9148#L-1 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; 9125#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9126#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;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; 9134#L545-3 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); 9149#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9167#L545-3 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); 9169#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9150#L545-3 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); 9145#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9146#L545-3 assume !(lis_~i~0 < lis_~N); 9153#L545-4 lis_~i~0 := 1; 9154#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9213#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9211#L549 assume !lis_#t~short11; 9212#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 9206#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9207#L548-3 assume !(lis_~j~0 < lis_~i~0); 9138#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9139#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9142#L548-3 [2018-11-22 21:42:31,937 INFO L796 eck$LassoCheckResult]: Loop: 9142#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9299#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; 9300#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 9307#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9142#L548-3 [2018-11-22 21:42:31,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 5 times [2018-11-22 21:42:31,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:31,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:31,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:31,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:31,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2127334, now seen corresponding path program 1 times [2018-11-22 21:42:31,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:31,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash -423959394, now seen corresponding path program 2 times [2018-11-22 21:42:31,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:31,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:42:32,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:32,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:42:32,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:42:32,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:42:32,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:32,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,297 INFO L478 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-22 21:42:32,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,307 INFO L478 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-22 21:42:32,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,314 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-22 21:42:32,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-22 21:42:32,333 INFO L478 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-22 21:42:32,336 INFO L478 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-22 21:42:32,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,345 INFO L478 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-22 21:42:32,348 INFO L478 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-22 21:42:32,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,356 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-22 21:42:32,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-22 21:42:32,396 INFO L478 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-22 21:42:32,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,398 INFO L478 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-22 21:42:32,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,409 INFO L478 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-22 21:42:32,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,412 INFO L478 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-22 21:42:32,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,426 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-22 21:42:32,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-22 21:42:32,477 INFO L478 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-22 21:42:32,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,482 INFO L478 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-22 21:42:32,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,497 INFO L478 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-22 21:42:32,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:32,503 INFO L478 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-22 21:42:32,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:32,522 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-22 21:42:32,531 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-22 21:42:32,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:65 [2018-11-22 21:42:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:42:32,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:32,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-11-22 21:42:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-22 21:42:32,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-22 21:42:32,785 INFO L87 Difference]: Start difference. First operand 244 states and 355 transitions. cyclomatic complexity: 132 Second operand 25 states. [2018-11-22 21:42:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:33,637 INFO L93 Difference]: Finished difference Result 243 states and 353 transitions. [2018-11-22 21:42:33,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 21:42:33,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 353 transitions. [2018-11-22 21:42:33,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-22 21:42:33,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 231 states and 341 transitions. [2018-11-22 21:42:33,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-22 21:42:33,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-11-22 21:42:33,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 341 transitions. [2018-11-22 21:42:33,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:33,640 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 341 transitions. [2018-11-22 21:42:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 341 transitions. [2018-11-22 21:42:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-11-22 21:42:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-22 21:42:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 341 transitions. [2018-11-22 21:42:33,644 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 341 transitions. [2018-11-22 21:42:33,644 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 341 transitions. [2018-11-22 21:42:33,644 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-22 21:42:33,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 341 transitions. [2018-11-22 21:42:33,645 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-22 21:42:33,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:33,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:33,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:33,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:42:33,646 INFO L794 eck$LassoCheckResult]: Stem: 9764#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9761#L-1 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; 9737#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9738#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;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; 9745#L545-3 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); 9762#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9763#L545-3 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); 9758#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9759#L545-3 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); 9776#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9773#L545-3 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); 9772#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9771#L545-3 assume !(lis_~i~0 < lis_~N); 9766#L545-4 lis_~i~0 := 1; 9767#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9792#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9791#L549 assume !lis_#t~short11; 9790#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 9787#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9784#L548-3 assume !(lis_~j~0 < lis_~i~0); 9785#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9755#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9756#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9891#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; 9889#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 9890#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9908#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9903#L549 [2018-11-22 21:42:33,646 INFO L796 eck$LassoCheckResult]: Loop: 9903#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; 9900#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 9901#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9907#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9903#L549 [2018-11-22 21:42:33,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1949150297, now seen corresponding path program 3 times [2018-11-22 21:42:33,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:33,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:33,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:42:34,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:34,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:42:34,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 21:42:34,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:42:34,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:34,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,137 INFO L478 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-22 21:42:34,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,151 INFO L478 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-22 21:42:34,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,158 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-22 21:42:34,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-22 21:42:34,173 INFO L478 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-22 21:42:34,182 INFO L478 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-22 21:42:34,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,188 INFO L478 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-22 21:42:34,190 INFO L478 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-22 21:42:34,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,197 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-22 21:42:34,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-22 21:42:34,240 INFO L478 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-22 21:42:34,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,242 INFO L478 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-22 21:42:34,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,252 INFO L478 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-22 21:42:34,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,255 INFO L478 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-22 21:42:34,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,267 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-22 21:42:34,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-22 21:42:34,320 INFO L478 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-22 21:42:34,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,324 INFO L478 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-22 21:42:34,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,339 INFO L478 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-22 21:42:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,344 INFO L478 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-22 21:42:34,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,363 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-22 21:42:34,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-11-22 21:42:34,431 INFO L478 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-22 21:42:34,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,439 INFO L478 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-22 21:42:34,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,461 INFO L478 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-22 21:42:34,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:34,476 INFO L478 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-22 21:42:34,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:34,513 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-22 21:42:34,527 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-22 21:42:34,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:83 [2018-11-22 21:42:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:42:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:34,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-22 21:42:34,842 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:42:34,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 2 times [2018-11-22 21:42:34,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:34,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-22 21:42:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-11-22 21:42:34,973 INFO L87 Difference]: Start difference. First operand 231 states and 341 transitions. cyclomatic complexity: 130 Second operand 30 states. [2018-11-22 21:42:38,179 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2018-11-22 21:42:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:42,230 INFO L93 Difference]: Finished difference Result 434 states and 611 transitions. [2018-11-22 21:42:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-22 21:42:42,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 611 transitions. [2018-11-22 21:42:42,232 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72 [2018-11-22 21:42:42,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 432 states and 609 transitions. [2018-11-22 21:42:42,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2018-11-22 21:42:42,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2018-11-22 21:42:42,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 609 transitions. [2018-11-22 21:42:42,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:42,235 INFO L705 BuchiCegarLoop]: Abstraction has 432 states and 609 transitions. [2018-11-22 21:42:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 609 transitions. [2018-11-22 21:42:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 195. [2018-11-22 21:42:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-22 21:42:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2018-11-22 21:42:42,239 INFO L728 BuchiCegarLoop]: Abstraction has 195 states and 283 transitions. [2018-11-22 21:42:42,239 INFO L608 BuchiCegarLoop]: Abstraction has 195 states and 283 transitions. [2018-11-22 21:42:42,239 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-22 21:42:42,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 283 transitions. [2018-11-22 21:42:42,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2018-11-22 21:42:42,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:42,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:42,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:42,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-22 21:42:42,241 INFO L794 eck$LassoCheckResult]: Stem: 10599#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10596#L-1 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; 10573#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10574#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;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; 10581#L545-3 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); 10597#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10598#L545-3 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); 10594#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10595#L545-3 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); 10608#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10607#L545-3 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); 10606#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10605#L545-3 assume !(lis_~i~0 < lis_~N); 10601#L545-4 lis_~i~0 := 1; 10602#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10630#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10629#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; 10626#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 10624#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10620#L548-3 assume !(lis_~j~0 < lis_~i~0); 10585#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10587#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10702#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10698#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; 10696#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 10694#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10692#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10689#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; 10678#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 10680#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10728#L548-3 assume !(lis_~j~0 < lis_~i~0); 10725#L547-2 [2018-11-22 21:42:42,241 INFO L796 eck$LassoCheckResult]: Loop: 10725#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10609#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10610#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10741#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; 10739#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 10738#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10737#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10732#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; 10733#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 10743#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10736#L548-3 assume !(lis_~j~0 < lis_~i~0); 10725#L547-2 [2018-11-22 21:42:42,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 5 times [2018-11-22 21:42:42,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:42,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:42,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 6 times [2018-11-22 21:42:42,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:42,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1491595148, now seen corresponding path program 6 times [2018-11-22 21:42:42,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:42,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-22 21:42:42,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:42,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:42,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 21:42:42,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-22 21:42:42,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:42:42,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-22 21:42:42,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:42,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-22 21:42:42,761 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-22 21:42:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 21:42:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:42:42,843 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. cyclomatic complexity: 104 Second operand 17 states. [2018-11-22 21:42:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:42:43,017 INFO L93 Difference]: Finished difference Result 427 states and 611 transitions. [2018-11-22 21:42:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:42:43,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 611 transitions. [2018-11-22 21:42:43,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2018-11-22 21:42:43,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 307 states and 450 transitions. [2018-11-22 21:42:43,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-11-22 21:42:43,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-22 21:42:43,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 450 transitions. [2018-11-22 21:42:43,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:42:43,020 INFO L705 BuchiCegarLoop]: Abstraction has 307 states and 450 transitions. [2018-11-22 21:42:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 450 transitions. [2018-11-22 21:42:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 132. [2018-11-22 21:42:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-22 21:42:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2018-11-22 21:42:43,022 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 189 transitions. [2018-11-22 21:42:43,022 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 189 transitions. [2018-11-22 21:42:43,022 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-22 21:42:43,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 189 transitions. [2018-11-22 21:42:43,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-22 21:42:43,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:42:43,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:42:43,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:42:43,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:42:43,023 INFO L794 eck$LassoCheckResult]: Stem: 11381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11378#L-1 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; 11360#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11361#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;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; 11368#L545-3 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); 11379#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11380#L545-3 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); 11375#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11376#L545-3 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); 11392#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11389#L545-3 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); 11388#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11387#L545-3 assume !(lis_~i~0 < lis_~N); 11383#L545-4 lis_~i~0 := 1; 11384#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11402#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11400#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; 11401#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 11403#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11404#L548-3 assume !(lis_~j~0 < lis_~i~0); 11434#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11432#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11430#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11426#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; 11424#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 11421#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11419#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11416#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; 11409#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 11411#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11489#L548-3 assume !(lis_~j~0 < lis_~i~0); 11393#L547-2 [2018-11-22 21:42:43,023 INFO L796 eck$LassoCheckResult]: Loop: 11393#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11390#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11391#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11473#L549 assume !lis_#t~short11; 11472#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 11470#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11469#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11468#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; 11466#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 11465#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11463#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11459#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; 11460#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 11464#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11462#L548-3 assume !(lis_~j~0 < lis_~i~0); 11393#L547-2 [2018-11-22 21:42:43,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 7 times [2018-11-22 21:42:43,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:43,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 654286184, now seen corresponding path program 2 times [2018-11-22 21:42:43,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:42:43,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:42:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2085578733, now seen corresponding path program 6 times [2018-11-22 21:42:43,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:42:43,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:42:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:42:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:42:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 21 proven. 77 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 21:42:43,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:43,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:42:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 21:42:43,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-22 21:42:43,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:42:43,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:43,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,753 INFO L478 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-22 21:42:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,772 INFO L478 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-22 21:42:43,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-11-22 21:42:43,892 INFO L478 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-22 21:42:43,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,896 INFO L478 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-22 21:42:43,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,909 INFO L478 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-22 21:42:43,911 INFO L478 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-22 21:42:43,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:43,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:90, output treesize:67 [2018-11-22 21:42:43,965 INFO L478 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 105 treesize of output 89 [2018-11-22 21:42:43,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:43,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 84 [2018-11-22 21:42:43,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:42:44,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,014 INFO L478 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 72 treesize of output 89 [2018-11-22 21:42:44,016 INFO L478 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-22 21:42:44,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,032 INFO L478 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 65 treesize of output 72 [2018-11-22 21:42:44,035 INFO L478 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-22 21:42:44,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,053 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-22 21:42:44,073 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-22 21:42:44,073 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:126, output treesize:140 [2018-11-22 21:42:44,390 INFO L478 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 131 treesize of output 107 [2018-11-22 21:42:44,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,419 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 145 [2018-11-22 21:42:44,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-22 21:42:44,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,512 INFO L478 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 89 treesize of output 104 [2018-11-22 21:42:44,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,515 INFO L478 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 27 treesize of output 41 [2018-11-22 21:42:44,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,535 INFO L478 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 94 treesize of output 101 [2018-11-22 21:42:44,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,538 INFO L478 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 39 treesize of output 53 [2018-11-22 21:42:44,538 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,556 INFO L478 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 101 treesize of output 106 [2018-11-22 21:42:44,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,559 INFO L478 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 54 treesize of output 70 [2018-11-22 21:42:44,560 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,579 INFO L478 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 82 treesize of output 89 [2018-11-22 21:42:44,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,582 INFO L478 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 27 treesize of output 54 [2018-11-22 21:42:44,583 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,594 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-22 21:42:44,809 INFO L478 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 138 treesize of output 118 [2018-11-22 21:42:44,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,828 INFO L478 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 30 treesize of output 92 [2018-11-22 21:42:44,828 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-22 21:42:44,867 INFO L478 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 91 treesize of output 98 [2018-11-22 21:42:44,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,876 INFO L478 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 29 treesize of output 56 [2018-11-22 21:42:44,876 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,890 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,898 INFO L478 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 101 treesize of output 108 [2018-11-22 21:42:44,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:44,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-22 21:42:44,902 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,914 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:42:45,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-11-22 21:42:45,065 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:270, output treesize:639 [2018-11-22 21:42:45,563 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-11-22 21:42:58,543 WARN L180 SmtUtils]: Spent 12.91 s on a formula simplification that was a NOOP. DAG size: 193 [2018-11-22 21:42:58,562 INFO L478 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 115 treesize of output 99 [2018-11-22 21:42:58,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 82 [2018-11-22 21:42:58,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-22 21:42:58,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:58,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 20 [2018-11-22 21:42:58,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,199 INFO L478 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 99 treesize of output 95 [2018-11-22 21:42:59,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-22 21:42:59,203 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 20 [2018-11-22 21:42:59,221 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,236 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2018-11-22 21:42:59,236 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,448 INFO L478 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 134 treesize of output 118 [2018-11-22 21:42:59,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-22 21:42:59,453 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 82 [2018-11-22 21:42:59,482 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 77 [2018-11-22 21:42:59,510 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-22 21:42:59,522 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,625 INFO L478 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 118 treesize of output 106 [2018-11-22 21:42:59,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-22 21:42:59,630 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,654 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2018-11-22 21:42:59,655 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 77 [2018-11-22 21:42:59,681 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-22 21:42:59,692 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,842 INFO L478 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 127 treesize of output 111 [2018-11-22 21:42:59,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 108 [2018-11-22 21:42:59,863 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-11-22 21:42:59,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 82 [2018-11-22 21:42:59,903 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 24 [2018-11-22 21:42:59,921 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,930 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:59,989 INFO L478 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 111 treesize of output 91 [2018-11-22 21:42:59,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:59,996 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2018-11-22 21:42:59,996 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:00,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 108 [2018-11-22 21:43:00,030 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-11-22 21:43:00,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:00,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 24 [2018-11-22 21:43:00,053 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:00,064 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:00,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 48 dim-0 vars, 12 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:43:00,117 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 60 variables, input treesize:1413, output treesize:34 [2018-11-22 21:43:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 21:43:00,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:43:00,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-11-22 21:43:00,664 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-11-22 21:43:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-22 21:43:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2018-11-22 21:43:00,759 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. cyclomatic complexity: 65 Second operand 36 states. [2018-11-22 21:43:04,144 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 119 [2018-11-22 21:43:04,702 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 125 [2018-11-22 21:43:05,110 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 126 [2018-11-22 21:43:06,214 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-11-22 21:43:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:43:06,470 INFO L93 Difference]: Finished difference Result 254 states and 325 transitions. [2018-11-22 21:43:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-22 21:43:06,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 325 transitions. [2018-11-22 21:43:06,471 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 37 [2018-11-22 21:43:06,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 227 states and 289 transitions. [2018-11-22 21:43:06,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2018-11-22 21:43:06,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-22 21:43:06,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 289 transitions. [2018-11-22 21:43:06,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:43:06,473 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 289 transitions. [2018-11-22 21:43:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 289 transitions. [2018-11-22 21:43:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 157. [2018-11-22 21:43:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-22 21:43:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 206 transitions. [2018-11-22 21:43:06,475 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 206 transitions. [2018-11-22 21:43:06,475 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 206 transitions. [2018-11-22 21:43:06,475 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-22 21:43:06,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 206 transitions. [2018-11-22 21:43:06,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-11-22 21:43:06,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:43:06,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:43:06,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:43:06,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:43:06,476 INFO L794 eck$LassoCheckResult]: Stem: 12052#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12049#L-1 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; 12028#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12029#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;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; 12038#L545-3 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); 12050#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12051#L545-3 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); 12047#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12048#L545-3 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); 12063#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12062#L545-3 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); 12061#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12060#L545-3 assume !(lis_~i~0 < lis_~N); 12054#L545-4 lis_~i~0 := 1; 12055#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12074#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12069#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; 12070#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12090#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12084#L548-3 assume !(lis_~j~0 < lis_~i~0); 12085#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12113#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12112#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12110#L549 assume !lis_#t~short11; 12111#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 12076#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12077#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12145#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; 12143#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12144#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12068#L548-3 assume !(lis_~j~0 < lis_~i~0); 12066#L547-2 [2018-11-22 21:43:06,476 INFO L796 eck$LassoCheckResult]: Loop: 12066#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12067#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12138#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12139#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; 12133#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12131#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12132#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12179#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; 12176#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12175#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12167#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12168#L549 assume !lis_#t~short11; 12163#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 12164#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12169#L548-3 assume !(lis_~j~0 < lis_~i~0); 12066#L547-2 [2018-11-22 21:43:06,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1174793308, now seen corresponding path program 7 times [2018-11-22 21:43:06,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:43:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:43:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:06,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:43:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 21:43:06,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:43:06,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:43:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:43:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:06,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:43:06,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:06,857 INFO L478 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-22 21:43:06,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:06,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:06,867 INFO L478 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-22 21:43:06,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-22 21:43:06,968 INFO L478 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-22 21:43:06,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:06,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:06,973 INFO L478 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-22 21:43:06,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,993 INFO L478 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-22 21:43:06,995 INFO L478 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-22 21:43:06,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:07,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:07,009 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-22 21:43:07,019 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-22 21:43:07,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-11-22 21:43:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:43:07,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:43:07,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-22 21:43:07,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:43:07,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash -304882328, now seen corresponding path program 3 times [2018-11-22 21:43:07,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:43:07,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:43:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:43:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:07,734 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 128 [2018-11-22 21:43:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-22 21:43:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2018-11-22 21:43:07,826 INFO L87 Difference]: Start difference. First operand 157 states and 206 transitions. cyclomatic complexity: 57 Second operand 28 states. [2018-11-22 21:43:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:43:09,533 INFO L93 Difference]: Finished difference Result 290 states and 376 transitions. [2018-11-22 21:43:09,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-22 21:43:09,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 376 transitions. [2018-11-22 21:43:09,534 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 89 [2018-11-22 21:43:09,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 376 transitions. [2018-11-22 21:43:09,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-22 21:43:09,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2018-11-22 21:43:09,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 376 transitions. [2018-11-22 21:43:09,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:43:09,536 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 376 transitions. [2018-11-22 21:43:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 376 transitions. [2018-11-22 21:43:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 230. [2018-11-22 21:43:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-22 21:43:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 299 transitions. [2018-11-22 21:43:09,540 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 299 transitions. [2018-11-22 21:43:09,540 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 299 transitions. [2018-11-22 21:43:09,540 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-22 21:43:09,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 299 transitions. [2018-11-22 21:43:09,541 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 58 [2018-11-22 21:43:09,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:43:09,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:43:09,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:43:09,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-22 21:43:09,542 INFO L794 eck$LassoCheckResult]: Stem: 12701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12698#L-1 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; 12678#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12679#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;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; 12687#L545-3 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); 12699#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12700#L545-3 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); 12695#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12696#L545-3 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); 12710#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12709#L545-3 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); 12708#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12707#L545-3 assume !(lis_~i~0 < lis_~N); 12703#L545-4 lis_~i~0 := 1; 12704#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12735#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12734#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; 12732#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12730#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12728#L548-3 assume !(lis_~j~0 < lis_~i~0); 12690#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12691#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12753#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12752#L549 assume !lis_#t~short11; 12737#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 12683#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12686#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12689#L549 assume !lis_#t~short11; 12706#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 12764#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12714#L548-3 assume !(lis_~j~0 < lis_~i~0); 12713#L547-2 [2018-11-22 21:43:09,542 INFO L796 eck$LassoCheckResult]: Loop: 12713#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12711#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12712#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12874#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; 12871#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12684#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12685#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12688#L549 assume !lis_#t~short11; 12680#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 12681#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12775#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12772#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; 12773#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 12761#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12762#L548-3 assume !(lis_~j~0 < lis_~i~0); 12713#L547-2 [2018-11-22 21:43:09,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1174854812, now seen corresponding path program 8 times [2018-11-22 21:43:09,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:43:09,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:43:09,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:43:09,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:09,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 660716904, now seen corresponding path program 4 times [2018-11-22 21:43:09,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:43:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:43:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:43:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:43:09,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1117304685, now seen corresponding path program 9 times [2018-11-22 21:43:09,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:43:09,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:43:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:43:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:43:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 21:43:10,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:43:10,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:43:10,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:43:10,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 21:43:10,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:43:10,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:43:10,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,505 INFO L478 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-22 21:43:10,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,518 INFO L478 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-22 21:43:10,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,529 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-22 21:43:10,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-11-22 21:43:10,587 INFO L478 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-22 21:43:10,589 INFO L478 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-22 21:43:10,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-22 21:43:10,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-22 21:43:10,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,604 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-22 21:43:10,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:32 [2018-11-22 21:43:10,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,666 INFO L478 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 58 treesize of output 67 [2018-11-22 21:43:10,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,678 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 62 [2018-11-22 21:43:10,679 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-22 21:43:10,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,697 INFO L478 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 45 treesize of output 63 [2018-11-22 21:43:10,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,709 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 72 [2018-11-22 21:43:10,710 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-22 21:43:10,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,728 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-22 21:43:10,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:10,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:50 [2018-11-22 21:43:10,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 93 [2018-11-22 21:43:10,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,885 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 122 [2018-11-22 21:43:10,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-22 21:43:10,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 89 [2018-11-22 21:43:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,976 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:43:10,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:10,993 INFO L478 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 162 [2018-11-22 21:43:10,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:43:11,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,031 INFO L478 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 79 treesize of output 91 [2018-11-22 21:43:11,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,055 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 135 [2018-11-22 21:43:11,056 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:43:11,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,090 INFO L478 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 69 treesize of output 83 [2018-11-22 21:43:11,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,106 INFO L478 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 4 case distinctions, treesize of input 42 treesize of output 97 [2018-11-22 21:43:11,107 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:43:11,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,131 INFO L478 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 86 treesize of output 98 [2018-11-22 21:43:11,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,155 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 135 [2018-11-22 21:43:11,156 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:43:11,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,205 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-22 21:43:11,225 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-22 21:43:11,225 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:99, output treesize:129 [2018-11-22 21:43:11,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 154 [2018-11-22 21:43:11,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:11,593 INFO L478 Elim1Store]: Elim1 applied some 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 6 new quantified variables, introduced 26 case distinctions, treesize of input 114 treesize of output 338 [2018-11-22 21:43:11,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-22 21:43:11,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 150 dim-0 vars, End of recursive call: 150 dim-0 vars, and 225 xjuncts. [2018-11-22 21:44:36,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,962 INFO L478 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 125 treesize of output 133 [2018-11-22 21:44:36,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:36,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,001 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 173 [2018-11-22 21:44:37,001 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-22 21:44:37,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 137 [2018-11-22 21:44:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,084 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 148 [2018-11-22 21:44:37,085 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,131 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,137 INFO L478 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 155 treesize of output 163 [2018-11-22 21:44:37,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:37,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,178 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 203 [2018-11-22 21:44:37,179 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:37,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,235 INFO L478 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 120 treesize of output 130 [2018-11-22 21:44:37,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,270 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 172 [2018-11-22 21:44:37,271 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,319 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,324 INFO L478 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 116 treesize of output 126 [2018-11-22 21:44:37,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,362 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 144 [2018-11-22 21:44:37,363 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,403 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,409 INFO L478 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 125 treesize of output 133 [2018-11-22 21:44:37,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,441 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 83 treesize of output 156 [2018-11-22 21:44:37,442 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,483 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,489 INFO L478 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 136 treesize of output 144 [2018-11-22 21:44:37,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,530 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 178 [2018-11-22 21:44:37,530 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,583 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 139 [2018-11-22 21:44:37,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,598 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:37,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,624 INFO L478 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 155 [2018-11-22 21:44:37,626 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:37,704 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:37,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 139 [2018-11-22 21:44:37,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,719 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:37,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,745 INFO L478 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 155 [2018-11-22 21:44:37,747 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:37,824 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:37,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,830 INFO L478 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 136 treesize of output 144 [2018-11-22 21:44:37,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,862 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 178 [2018-11-22 21:44:37,863 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:37,912 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,918 INFO L478 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 162 treesize of output 170 [2018-11-22 21:44:37,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:37,950 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 182 [2018-11-22 21:44:37,951 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,007 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,012 INFO L478 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 120 treesize of output 130 [2018-11-22 21:44:38,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,044 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 148 [2018-11-22 21:44:38,045 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,089 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,095 INFO L478 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 136 treesize of output 146 [2018-11-22 21:44:38,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,118 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 138 [2018-11-22 21:44:38,119 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,160 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,165 INFO L478 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 129 treesize of output 139 [2018-11-22 21:44:38,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,198 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 172 [2018-11-22 21:44:38,199 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,248 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 143 [2018-11-22 21:44:38,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,268 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,289 INFO L478 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 181 [2018-11-22 21:44:38,290 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,368 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,375 INFO L478 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 123 treesize of output 133 [2018-11-22 21:44:38,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,416 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 144 [2018-11-22 21:44:38,417 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,458 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 135 [2018-11-22 21:44:38,470 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,485 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 128 [2018-11-22 21:44:38,487 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,538 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,543 INFO L478 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 109 treesize of output 119 [2018-11-22 21:44:38,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,573 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 140 [2018-11-22 21:44:38,574 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,609 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 142 [2018-11-22 21:44:38,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,671 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 151 [2018-11-22 21:44:38,673 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,753 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 122 [2018-11-22 21:44:38,761 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,766 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,778 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 106 [2018-11-22 21:44:38,779 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,830 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:38,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,837 INFO L478 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 153 treesize of output 161 [2018-11-22 21:44:38,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,869 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 182 [2018-11-22 21:44:38,870 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:38,923 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:38,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 135 [2018-11-22 21:44:38,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:38,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:38,952 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 140 [2018-11-22 21:44:38,953 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,014 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,020 INFO L478 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 132 treesize of output 140 [2018-11-22 21:44:39,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,054 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 83 treesize of output 156 [2018-11-22 21:44:39,055 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,097 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,103 INFO L478 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 158 treesize of output 166 [2018-11-22 21:44:39,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,144 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 182 [2018-11-22 21:44:39,145 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,205 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 122 [2018-11-22 21:44:39,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,215 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:39,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,222 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:39,231 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 134 [2018-11-22 21:44:39,232 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,299 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,304 INFO L478 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 112 treesize of output 122 [2018-11-22 21:44:39,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,336 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 140 [2018-11-22 21:44:39,337 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,374 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,380 INFO L478 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 111 treesize of output 121 [2018-11-22 21:44:39,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:39,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,407 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 167 [2018-11-22 21:44:39,408 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,440 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,447 INFO L478 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 155 treesize of output 163 [2018-11-22 21:44:39,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,482 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 178 [2018-11-22 21:44:39,483 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,538 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,545 INFO L478 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 145 treesize of output 153 [2018-11-22 21:44:39,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,586 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 182 [2018-11-22 21:44:39,587 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,646 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,652 INFO L478 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 155 treesize of output 163 [2018-11-22 21:44:39,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,686 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 178 [2018-11-22 21:44:39,686 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,742 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,748 INFO L478 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 119 treesize of output 129 [2018-11-22 21:44:39,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,786 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 148 [2018-11-22 21:44:39,786 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,825 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 135 [2018-11-22 21:44:39,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,863 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 83 treesize of output 156 [2018-11-22 21:44:39,864 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:39,902 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,908 INFO L478 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 118 treesize of output 126 [2018-11-22 21:44:39,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,913 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,937 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 183 [2018-11-22 21:44:39,938 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:39,974 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:39,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,979 INFO L478 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 116 treesize of output 124 [2018-11-22 21:44:39,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:39,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,011 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 83 treesize of output 156 [2018-11-22 21:44:40,011 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:40,049 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:40,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 146 [2018-11-22 21:44:40,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,064 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:40,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,102 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 151 [2018-11-22 21:44:40,104 INFO L267 ElimStorePlain]: Start of recursive call 73: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:40,180 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:40,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,185 INFO L478 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 112 treesize of output 122 [2018-11-22 21:44:40,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,215 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 140 [2018-11-22 21:44:40,216 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:40,255 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:40,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,260 INFO L478 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 122 treesize of output 132 [2018-11-22 21:44:40,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:40,294 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 148 [2018-11-22 21:44:40,294 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:40,336 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:41,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 31 xjuncts. [2018-11-22 21:44:43,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 144 [2018-11-22 21:44:43,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,162 INFO L478 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 4 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 205 [2018-11-22 21:44:43,163 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-22 21:44:43,173 INFO L267 ElimStorePlain]: Start of recursive call 79: 30 dim-0 vars, End of recursive call: 30 dim-0 vars, and 45 xjuncts. [2018-11-22 21:44:43,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,663 INFO L478 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 86 treesize of output 96 [2018-11-22 21:44:43,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,696 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 158 [2018-11-22 21:44:43,697 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:43,737 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:43,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,742 INFO L478 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 88 treesize of output 98 [2018-11-22 21:44:43,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,748 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:43,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,776 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 185 [2018-11-22 21:44:43,777 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:43,815 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:43,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 107 [2018-11-22 21:44:43,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:43,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,843 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 118 [2018-11-22 21:44:43,844 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:43,899 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:43,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 105 [2018-11-22 21:44:43,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,938 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 158 [2018-11-22 21:44:43,939 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:43,982 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:43,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 107 [2018-11-22 21:44:43,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,991 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:44:43,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:43,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,011 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 130 [2018-11-22 21:44:44,012 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:44,078 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:44:44,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,083 INFO L478 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 92 treesize of output 102 [2018-11-22 21:44:44,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,114 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 158 [2018-11-22 21:44:44,115 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:44,167 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:44,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,173 INFO L478 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 97 treesize of output 107 [2018-11-22 21:44:44,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,204 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 158 [2018-11-22 21:44:44,205 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:44:44,245 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:44,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,251 INFO L478 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 96 treesize of output 108 [2018-11-22 21:44:44,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:44,281 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 134 [2018-11-22 21:44:44,282 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-22 21:44:44,365 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-22 21:44:44,517 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 11 xjuncts. [2018-11-22 21:44:45,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 88 dim-0 vars, and 42 xjuncts. [2018-11-22 21:44:45,805 INFO L202 ElimStorePlain]: Needed 95 recursive calls to eliminate 4 variables, input treesize:269, output treesize:4766 [2018-11-22 21:44:47,013 WARN L180 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 934 DAG size of output: 258 [2018-11-22 21:44:47,442 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2018-11-22 21:44:47,888 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2018-11-22 21:44:48,233 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 98 [2018-11-22 21:44:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-22 21:44:48,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:44:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-11-22 21:44:48,794 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 128 [2018-11-22 21:44:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-22 21:44:48,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2018-11-22 21:44:48,877 INFO L87 Difference]: Start difference. First operand 230 states and 299 transitions. cyclomatic complexity: 81 Second operand 37 states. [2018-11-22 21:44:51,288 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 104 [2018-11-22 21:44:51,748 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 108 [2018-11-22 21:44:52,553 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 110 [2018-11-22 21:44:53,490 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 108 [2018-11-22 21:44:55,730 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 104 [2018-11-22 21:44:56,296 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 106 [2018-11-22 21:44:56,986 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 108 [2018-11-22 21:44:57,610 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2018-11-22 21:44:58,073 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2018-11-22 21:45:01,029 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 272 [2018-11-22 21:45:01,831 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 278 [2018-11-22 21:45:02,504 WARN L180 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 280 [2018-11-22 21:45:03,539 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 278 [2018-11-22 21:45:03,784 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-11-22 21:45:03,979 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-22 21:45:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:04,467 INFO L93 Difference]: Finished difference Result 743 states and 959 transitions. [2018-11-22 21:45:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-11-22 21:45:04,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 743 states and 959 transitions. [2018-11-22 21:45:04,469 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 185 [2018-11-22 21:45:04,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 743 states to 724 states and 940 transitions. [2018-11-22 21:45:04,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 670 [2018-11-22 21:45:04,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2018-11-22 21:45:04,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 724 states and 940 transitions. [2018-11-22 21:45:04,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:04,472 INFO L705 BuchiCegarLoop]: Abstraction has 724 states and 940 transitions. [2018-11-22 21:45:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states and 940 transitions. [2018-11-22 21:45:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 351. [2018-11-22 21:45:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-22 21:45:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 460 transitions. [2018-11-22 21:45:04,485 INFO L728 BuchiCegarLoop]: Abstraction has 351 states and 460 transitions. [2018-11-22 21:45:04,485 INFO L608 BuchiCegarLoop]: Abstraction has 351 states and 460 transitions. [2018-11-22 21:45:04,485 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-22 21:45:04,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 351 states and 460 transitions. [2018-11-22 21:45:04,486 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 97 [2018-11-22 21:45:04,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:04,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:04,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:04,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-11-22 21:45:04,486 INFO L794 eck$LassoCheckResult]: Stem: 14126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14123#L-1 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; 14102#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14103#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;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; 14111#L545-3 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); 14124#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14125#L545-3 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); 14121#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14122#L545-3 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); 14139#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14137#L545-3 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); 14138#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14198#L545-3 assume !(lis_~i~0 < lis_~N); 14197#L545-4 lis_~i~0 := 1; 14196#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14195#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14165#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; 14166#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 14213#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14212#L548-3 assume !(lis_~j~0 < lis_~i~0); 14211#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14210#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14209#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14207#L549 assume !lis_#t~short11; 14208#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 14266#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14262#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14263#L549 assume !lis_#t~short11; 14290#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 14289#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14288#L548-3 assume !(lis_~j~0 < lis_~i~0); 14286#L547-2 [2018-11-22 21:45:04,487 INFO L796 eck$LassoCheckResult]: Loop: 14286#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14285#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14284#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14282#L549 assume !lis_#t~short11; 14281#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 14280#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14279#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14275#L549 assume !lis_#t~short11; 14271#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 14272#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14267#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14268#L549 assume !lis_#t~short11; 14256#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 14255#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14287#L548-3 assume !(lis_~j~0 < lis_~i~0); 14286#L547-2 [2018-11-22 21:45:04,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1174854812, now seen corresponding path program 10 times [2018-11-22 21:45:04,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:04,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:04,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:04,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:04,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1620008424, now seen corresponding path program 2 times [2018-11-22 21:45:04,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:04,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2076596205, now seen corresponding path program 11 times [2018-11-22 21:45:04,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:04,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:04,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:04,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:08,593 WARN L180 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 303 DAG size of output: 213 [2018-11-22 21:45:10,041 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 147 [2018-11-22 21:45:10,043 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:45:10,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:45:10,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:45:10,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:45:10,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:45:10,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:45:10,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:45:10,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:45:10,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration23_Lasso [2018-11-22 21:45:10,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:45:10,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:45:10,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:10,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-22 21:45:10,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:10,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:10,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-22 21:45:10,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:10,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-22 21:45:10,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-22 21:45:10,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-22 21:45:10,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,343 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 118 [2018-11-22 21:45:12,532 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 75 [2018-11-22 21:45:12,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:45:12,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:45:12,920 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:45:12,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:45:12,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:45:12,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:45:12,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:45:12,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:45:12,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:45:12,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:45:12,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:45:12,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:45:12,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:45:12,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:45:12,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:45:12,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:45:12,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:45:12,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:45:12,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:45:12,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:45:12,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:45:12,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:45:12,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:45:12,982 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 21:45:12,983 INFO L444 ModelExtractionUtils]: 48 out of 58 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-22 21:45:12,983 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:45:12,983 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:45:12,984 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:45:12,984 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 5 Supporting invariants [] [2018-11-22 21:45:13,407 INFO L297 tatePredicateManager]: 90 out of 90 supporting invariants were superfluous and have been removed [2018-11-22 21:45:13,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:13,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:13,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:45:13,511 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-22 21:45:13,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 351 states and 460 transitions. cyclomatic complexity: 122 Second operand 7 states. [2018-11-22 21:45:13,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 351 states and 460 transitions. cyclomatic complexity: 122. Second operand 7 states. Result 936 states and 1241 transitions. Complement of second has 13 states. [2018-11-22 21:45:13,599 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-22 21:45:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:45:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-22 21:45:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-22 21:45:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:45:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 46 letters. Loop has 15 letters. [2018-11-22 21:45:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:45:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 31 letters. Loop has 30 letters. [2018-11-22 21:45:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:45:13,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 936 states and 1241 transitions. [2018-11-22 21:45:13,603 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 133 [2018-11-22 21:45:13,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 936 states to 879 states and 1170 transitions. [2018-11-22 21:45:13,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 364 [2018-11-22 21:45:13,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2018-11-22 21:45:13,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1170 transitions. [2018-11-22 21:45:13,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:13,608 INFO L705 BuchiCegarLoop]: Abstraction has 879 states and 1170 transitions. [2018-11-22 21:45:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1170 transitions. [2018-11-22 21:45:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 736. [2018-11-22 21:45:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-22 21:45:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 982 transitions. [2018-11-22 21:45:13,621 INFO L728 BuchiCegarLoop]: Abstraction has 736 states and 982 transitions. [2018-11-22 21:45:13,621 INFO L608 BuchiCegarLoop]: Abstraction has 736 states and 982 transitions. [2018-11-22 21:45:13,621 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-22 21:45:13,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 736 states and 982 transitions. [2018-11-22 21:45:13,623 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 117 [2018-11-22 21:45:13,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:13,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:13,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:13,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2018-11-22 21:45:13,623 INFO L794 eck$LassoCheckResult]: Stem: 15950#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15947#L-1 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; 15924#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15925#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;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; 15932#L545-3 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); 15948#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15949#L545-3 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); 15944#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15945#L545-3 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); 15965#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15963#L545-3 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); 15964#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15959#L545-3 assume !(lis_~i~0 < lis_~N); 15961#L545-4 lis_~i~0 := 1; 15984#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15985#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15980#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; 15981#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 16031#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16032#L548-3 assume !(lis_~j~0 < lis_~i~0); 16026#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16027#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16018#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16019#L549 assume !lis_#t~short11; 16132#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16131#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16130#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16129#L549 assume !lis_#t~short11; 16111#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16112#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16105#L548-3 assume !(lis_~j~0 < lis_~i~0); 16102#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16103#L547-3 [2018-11-22 21:45:13,624 INFO L796 eck$LassoCheckResult]: Loop: 16103#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16489#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16487#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; 16485#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16486#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16508#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16506#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; 16504#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16503#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16502#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16501#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; 16498#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16497#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16496#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 16492#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; 16494#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 16493#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16491#L548-3 assume !(lis_~j~0 < lis_~i~0); 16490#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16103#L547-3 [2018-11-22 21:45:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2060760860, now seen corresponding path program 12 times [2018-11-22 21:45:13,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:13,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1844934405, now seen corresponding path program 1 times [2018-11-22 21:45:13,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:13,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1492319242, now seen corresponding path program 13 times [2018-11-22 21:45:13,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-22 21:45:13,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:45:13,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:45:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:13,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-22 21:45:13,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:45:13,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-22 21:45:14,270 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 133 [2018-11-22 21:45:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 21:45:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-22 21:45:14,313 INFO L87 Difference]: Start difference. First operand 736 states and 982 transitions. cyclomatic complexity: 270 Second operand 17 states. [2018-11-22 21:45:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:14,554 INFO L93 Difference]: Finished difference Result 833 states and 1086 transitions. [2018-11-22 21:45:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-22 21:45:14,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 833 states and 1086 transitions. [2018-11-22 21:45:14,556 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2018-11-22 21:45:14,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 833 states to 593 states and 788 transitions. [2018-11-22 21:45:14,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-11-22 21:45:14,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2018-11-22 21:45:14,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 788 transitions. [2018-11-22 21:45:14,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:14,557 INFO L705 BuchiCegarLoop]: Abstraction has 593 states and 788 transitions. [2018-11-22 21:45:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 788 transitions. [2018-11-22 21:45:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 489. [2018-11-22 21:45:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-11-22 21:45:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 652 transitions. [2018-11-22 21:45:14,562 INFO L728 BuchiCegarLoop]: Abstraction has 489 states and 652 transitions. [2018-11-22 21:45:14,562 INFO L608 BuchiCegarLoop]: Abstraction has 489 states and 652 transitions. [2018-11-22 21:45:14,562 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-22 21:45:14,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 652 transitions. [2018-11-22 21:45:14,563 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2018-11-22 21:45:14,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:14,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:14,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:14,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:45:14,564 INFO L794 eck$LassoCheckResult]: Stem: 17715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17712#L-1 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; 17688#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17689#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;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; 17696#L545-3 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); 17713#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17714#L545-3 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); 17710#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17711#L545-3 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); 17729#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17727#L545-3 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); 17728#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17723#L545-3 assume !(lis_~i~0 < lis_~N); 17725#L545-4 lis_~i~0 := 1; 17705#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17706#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 17739#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; 17740#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 17975#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17974#L548-3 assume !(lis_~j~0 < lis_~i~0); 17973#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17972#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17971#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 17968#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; 17969#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18138#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18136#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18118#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; 18084#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18083#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18081#L548-3 assume !(lis_~j~0 < lis_~i~0); 18082#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17704#L547-3 assume !(lis_~i~0 < lis_~N); 17709#L547-4 lis_~i~0 := 0; 17686#L551-3 [2018-11-22 21:45:14,564 INFO L796 eck$LassoCheckResult]: Loop: 17686#L551-3 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); 17687#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; 17716#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 17686#L551-3 [2018-11-22 21:45:14,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1729039269, now seen corresponding path program 2 times [2018-11-22 21:45:14,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 21:45:14,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:45:14,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:45:14,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:45:14,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:45:14,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:45:14,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 21:45:14,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:45:14,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-22 21:45:14,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:45:14,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 2 times [2018-11-22 21:45:14,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:14,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:14,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-22 21:45:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-11-22 21:45:14,763 INFO L87 Difference]: Start difference. First operand 489 states and 652 transitions. cyclomatic complexity: 173 Second operand 20 states. [2018-11-22 21:45:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:14,977 INFO L93 Difference]: Finished difference Result 502 states and 671 transitions. [2018-11-22 21:45:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 21:45:14,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 502 states and 671 transitions. [2018-11-22 21:45:14,978 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2018-11-22 21:45:14,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 502 states to 501 states and 664 transitions. [2018-11-22 21:45:14,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2018-11-22 21:45:14,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2018-11-22 21:45:14,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 501 states and 664 transitions. [2018-11-22 21:45:14,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:14,980 INFO L705 BuchiCegarLoop]: Abstraction has 501 states and 664 transitions. [2018-11-22 21:45:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states and 664 transitions. [2018-11-22 21:45:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 488. [2018-11-22 21:45:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-22 21:45:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 644 transitions. [2018-11-22 21:45:14,983 INFO L728 BuchiCegarLoop]: Abstraction has 488 states and 644 transitions. [2018-11-22 21:45:14,983 INFO L608 BuchiCegarLoop]: Abstraction has 488 states and 644 transitions. [2018-11-22 21:45:14,983 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-22 21:45:14,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 488 states and 644 transitions. [2018-11-22 21:45:14,984 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2018-11-22 21:45:14,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:14,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:14,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:14,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2018-11-22 21:45:14,984 INFO L794 eck$LassoCheckResult]: Stem: 18848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18845#L-1 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; 18821#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18822#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;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; 18830#L545-3 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); 18846#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18847#L545-3 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); 18843#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18844#L545-3 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); 18863#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18861#L545-3 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); 18862#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18857#L545-3 assume !(lis_~i~0 < lis_~N); 18859#L545-4 lis_~i~0 := 1; 18839#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18840#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18876#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; 18877#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18870#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18871#L548-3 assume !(lis_~j~0 < lis_~i~0); 18831#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18832#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 19247#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 19246#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; 19208#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 19272#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19269#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 19266#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; 19264#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 19263#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19256#L548-3 assume !(lis_~j~0 < lis_~i~0); 19257#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 19224#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 19225#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 19214#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; 19215#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 19194#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19300#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 19183#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; 19175#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 19170#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19171#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 19285#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; 19158#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 19157#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19007#L548-3 assume !(lis_~j~0 < lis_~i~0); 18864#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18855#L547-3 [2018-11-22 21:45:14,984 INFO L796 eck$LassoCheckResult]: Loop: 18855#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18856#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18992#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; 18988#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18827#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18828#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18987#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; 18984#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18982#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18980#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18981#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; 18935#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18934#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18886#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18885#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; 18883#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 18881#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18882#L548-3 assume !(lis_~j~0 < lis_~i~0); 18865#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18855#L547-3 [2018-11-22 21:45:14,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 5950309, now seen corresponding path program 1 times [2018-11-22 21:45:14,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:14,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:45:15,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:45:15,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:45:15,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:15,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:15,973 INFO L478 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-22 21:45:15,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:15,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:15,992 INFO L478 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-22 21:45:15,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:15,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:15,999 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-22 21:45:15,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-22 21:45:16,042 INFO L478 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-22 21:45:16,044 INFO L478 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-22 21:45:16,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,050 INFO L478 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-22 21:45:16,052 INFO L478 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-22 21:45:16,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,058 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-22 21:45:16,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-22 21:45:16,114 INFO L478 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-22 21:45:16,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,117 INFO L478 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-22 21:45:16,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,128 INFO L478 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-22 21:45:16,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,134 INFO L478 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-22 21:45:16,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,147 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-22 21:45:16,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:48 [2018-11-22 21:45:16,215 INFO L478 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 70 treesize of output 60 [2018-11-22 21:45:16,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,219 INFO L478 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-22 21:45:16,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,236 INFO L478 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-22 21:45:16,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,241 INFO L478 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 88 [2018-11-22 21:45:16,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,262 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-22 21:45:16,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:74, output treesize:59 [2018-11-22 21:45:16,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,400 INFO L478 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 133 treesize of output 121 [2018-11-22 21:45:16,404 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 123 [2018-11-22 21:45:16,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:45:16,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 98 [2018-11-22 21:45:16,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 113 [2018-11-22 21:45:16,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,497 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,497 INFO L478 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 87 [2018-11-22 21:45:16,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,505 INFO L478 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 43 treesize of output 115 [2018-11-22 21:45:16,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,544 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-22 21:45:16,568 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-22 21:45:16,569 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:140, output treesize:163 [2018-11-22 21:45:16,770 INFO L478 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 123 [2018-11-22 21:45:16,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,782 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,809 INFO L478 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 80 treesize of output 291 [2018-11-22 21:45:16,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:45:16,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 137 [2018-11-22 21:45:16,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,906 INFO L478 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 103 treesize of output 192 [2018-11-22 21:45:16,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,933 INFO L478 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 96 treesize of output 101 [2018-11-22 21:45:16,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,939 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,940 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:16,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:16,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 151 [2018-11-22 21:45:16,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:16,987 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-22 21:45:17,076 INFO L478 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 136 treesize of output 106 [2018-11-22 21:45:17,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,096 INFO L478 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 45 treesize of output 191 [2018-11-22 21:45:17,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 99 [2018-11-22 21:45:17,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,136 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 170 [2018-11-22 21:45:17,141 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,163 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,173 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-22 21:45:17,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:45:17,218 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:294, output treesize:302 [2018-11-22 21:45:17,418 INFO L478 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 183 treesize of output 142 [2018-11-22 21:45:17,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,429 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 361 [2018-11-22 21:45:17,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,476 INFO L478 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 144 treesize of output 149 [2018-11-22 21:45:17,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,483 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,484 INFO L478 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 136 treesize of output 182 [2018-11-22 21:45:17,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,514 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-22 21:45:17,689 INFO L478 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 177 treesize of output 136 [2018-11-22 21:45:17,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,693 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 335 [2018-11-22 21:45:17,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,740 INFO L478 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 117 treesize of output 124 [2018-11-22 21:45:17,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 160 [2018-11-22 21:45:17,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,777 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-22 21:45:17,889 INFO L478 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 217 treesize of output 172 [2018-11-22 21:45:17,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,897 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:17,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,928 INFO L478 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 2 case distinctions, treesize of input 107 treesize of output 516 [2018-11-22 21:45:17,929 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:17,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,977 INFO L478 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 154 treesize of output 159 [2018-11-22 21:45:17,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:17,987 INFO L478 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 146 treesize of output 177 [2018-11-22 21:45:17,988 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:18,010 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:18,021 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-22 21:45:18,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-22 21:45:18,059 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:578, output treesize:283 [2018-11-22 21:45:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 15 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:45:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:45:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-11-22 21:45:18,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:45:18,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash -877842931, now seen corresponding path program 7 times [2018-11-22 21:45:18,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:18,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:18,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:18,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:21,472 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 250 DAG size of output: 180 [2018-11-22 21:45:21,917 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-22 21:45:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-22 21:45:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1693, Unknown=0, NotChecked=0, Total=1806 [2018-11-22 21:45:21,917 INFO L87 Difference]: Start difference. First operand 488 states and 644 transitions. cyclomatic complexity: 166 Second operand 43 states. [2018-11-22 21:45:24,730 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 63 [2018-11-22 21:45:25,115 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 64 [2018-11-22 21:45:26,228 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2018-11-22 21:45:26,600 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 111 [2018-11-22 21:45:27,079 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 101 [2018-11-22 21:45:27,862 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 110 [2018-11-22 21:45:28,253 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2018-11-22 21:45:29,000 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2018-11-22 21:45:29,270 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2018-11-22 21:45:29,655 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 99 [2018-11-22 21:45:29,880 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 100 [2018-11-22 21:45:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:31,804 INFO L93 Difference]: Finished difference Result 751 states and 982 transitions. [2018-11-22 21:45:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-22 21:45:31,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 751 states and 982 transitions. [2018-11-22 21:45:31,805 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 133 [2018-11-22 21:45:31,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 751 states to 751 states and 982 transitions. [2018-11-22 21:45:31,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2018-11-22 21:45:31,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2018-11-22 21:45:31,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 751 states and 982 transitions. [2018-11-22 21:45:31,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:31,808 INFO L705 BuchiCegarLoop]: Abstraction has 751 states and 982 transitions. [2018-11-22 21:45:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 982 transitions. [2018-11-22 21:45:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 504. [2018-11-22 21:45:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-22 21:45:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 664 transitions. [2018-11-22 21:45:31,814 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 664 transitions. [2018-11-22 21:45:31,814 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 664 transitions. [2018-11-22 21:45:31,815 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-22 21:45:31,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 664 transitions. [2018-11-22 21:45:31,816 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2018-11-22 21:45:31,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:31,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:31,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:31,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 2, 1, 1, 1] [2018-11-22 21:45:31,817 INFO L794 eck$LassoCheckResult]: Stem: 20416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 20413#L-1 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; 20388#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20389#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;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; 20397#L545-3 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); 20414#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20415#L545-3 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); 20410#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20411#L545-3 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); 20428#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20426#L545-3 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); 20427#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20422#L545-3 assume !(lis_~i~0 < lis_~N); 20424#L545-4 lis_~i~0 := 1; 20406#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20407#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20440#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; 20441#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20549#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20548#L548-3 assume !(lis_~j~0 < lis_~i~0); 20547#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20546#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20545#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20543#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; 20544#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20827#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20826#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20825#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; 20782#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20783#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20858#L548-3 assume !(lis_~j~0 < lis_~i~0); 20404#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20405#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20856#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20855#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; 20853#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20854#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20866#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20864#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; 20862#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 20861#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20860#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20859#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; 20843#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 20841#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20682#L548-3 assume !(lis_~j~0 < lis_~i~0); 20614#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20613#L547-3 [2018-11-22 21:45:31,817 INFO L796 eck$LassoCheckResult]: Loop: 20613#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20612#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20610#L549 assume !lis_#t~short11; 20609#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 20394#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20395#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20627#L549 assume !lis_#t~short11; 20625#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 20605#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20623#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20622#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; 20620#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20562#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20619#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20617#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; 20618#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 20481#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20616#L548-3 assume !(lis_~j~0 < lis_~i~0); 20446#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20613#L547-3 [2018-11-22 21:45:31,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -252215129, now seen corresponding path program 2 times [2018-11-22 21:45:31,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:45:33,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:45:33,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:45:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:45:33,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:45:33,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:45:33,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:33,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,098 INFO L478 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-22 21:45:33,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,112 INFO L478 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-22 21:45:33,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,120 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-22 21:45:33,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-22 21:45:33,203 INFO L478 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-22 21:45:33,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,206 INFO L478 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-22 21:45:33,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,215 INFO L478 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-22 21:45:33,217 INFO L478 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-22 21:45:33,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,224 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-22 21:45:33,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-11-22 21:45:33,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,303 INFO L478 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 107 treesize of output 97 [2018-11-22 21:45:33,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,320 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 111 [2018-11-22 21:45:33,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:45:33,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,348 INFO L478 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 65 treesize of output 74 [2018-11-22 21:45:33,350 INFO L478 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-22 21:45:33,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,361 INFO L478 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 55 treesize of output 64 [2018-11-22 21:45:33,362 INFO L478 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-22 21:45:33,363 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,368 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,378 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-22 21:45:33,392 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-22 21:45:33,393 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:117, output treesize:109 [2018-11-22 21:45:33,528 INFO L478 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 121 treesize of output 89 [2018-11-22 21:45:33,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,533 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:33,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,551 INFO L478 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 2 case distinctions, treesize of input 61 treesize of output 236 [2018-11-22 21:45:33,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-22 21:45:33,610 INFO L478 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-22 21:45:33,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,613 INFO L478 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 28 treesize of output 49 [2018-11-22 21:45:33,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,627 INFO L478 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 89 treesize of output 86 [2018-11-22 21:45:33,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,631 INFO L478 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 61 treesize of output 84 [2018-11-22 21:45:33,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,642 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,660 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-22 21:45:33,728 INFO L478 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 99 treesize of output 71 [2018-11-22 21:45:33,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:33,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,735 INFO L478 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 140 [2018-11-22 21:45:33,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-11-22 21:45:33,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:33,762 INFO L478 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 43 [2018-11-22 21:45:33,762 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,770 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:33,779 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-22 21:45:33,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-22 21:45:33,817 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:221, output treesize:257 [2018-11-22 21:45:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 15 proven. 83 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 21:45:34,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:45:34,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 42 [2018-11-22 21:45:34,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:45:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash 479067533, now seen corresponding path program 5 times [2018-11-22 21:45:34,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:34,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:34,843 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2018-11-22 21:45:34,961 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-22 21:45:34,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-22 21:45:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2018-11-22 21:45:34,962 INFO L87 Difference]: Start difference. First operand 504 states and 664 transitions. cyclomatic complexity: 170 Second operand 42 states. [2018-11-22 21:45:36,828 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-22 21:45:37,025 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 97 [2018-11-22 21:45:37,711 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2018-11-22 21:45:38,133 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2018-11-22 21:45:38,510 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2018-11-22 21:45:38,763 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2018-11-22 21:45:39,394 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2018-11-22 21:45:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:40,222 INFO L93 Difference]: Finished difference Result 662 states and 828 transitions. [2018-11-22 21:45:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-22 21:45:40,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 828 transitions. [2018-11-22 21:45:40,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2018-11-22 21:45:40,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 393 states and 507 transitions. [2018-11-22 21:45:40,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-22 21:45:40,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-22 21:45:40,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 393 states and 507 transitions. [2018-11-22 21:45:40,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:45:40,225 INFO L705 BuchiCegarLoop]: Abstraction has 393 states and 507 transitions. [2018-11-22 21:45:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states and 507 transitions. [2018-11-22 21:45:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2018-11-22 21:45:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-22 21:45:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 486 transitions. [2018-11-22 21:45:40,229 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2018-11-22 21:45:40,229 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2018-11-22 21:45:40,229 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-22 21:45:40,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 486 transitions. [2018-11-22 21:45:40,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2018-11-22 21:45:40,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:45:40,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:45:40,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 21:45:40,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2018-11-22 21:45:40,230 INFO L794 eck$LassoCheckResult]: Stem: 21866#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 21863#L-1 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; 21839#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 21840#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;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; 21847#L545-3 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); 21864#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21865#L545-3 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); 21861#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21862#L545-3 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); 21878#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21877#L545-3 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); 21876#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21875#L545-3 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); 21873#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21872#L545-3 assume !(lis_~i~0 < lis_~N); 21868#L545-4 lis_~i~0 := 1; 21856#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21857#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21889#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; 21886#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 21884#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21885#L548-3 assume !(lis_~j~0 < lis_~i~0); 21851#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21852#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22134#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22133#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; 22132#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 22130#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22129#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22126#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; 22127#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 22163#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22162#L548-3 assume !(lis_~j~0 < lis_~i~0); 22161#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22160#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22158#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22155#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; 22151#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 22149#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22147#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22145#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; 22143#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 22141#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22140#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 22139#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; 22138#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 22125#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21969#L548-3 assume !(lis_~j~0 < lis_~i~0); 21881#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21880#L547-3 [2018-11-22 21:45:40,231 INFO L796 eck$LassoCheckResult]: Loop: 21880#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21967#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21966#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; 21841#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 21842#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21845#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21972#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; 21956#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 21957#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21952#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21953#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; 21906#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 21904#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21903#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 21900#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; 21901#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 21895#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21896#L548-3 assume !(lis_~j~0 < lis_~i~0); 21879#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21880#L547-3 [2018-11-22 21:45:40,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1220314939, now seen corresponding path program 3 times [2018-11-22 21:45:40,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:40,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:45:41,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:45:41,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:45:41,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:45:41,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 21:45:41,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:45:41,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:41,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,563 INFO L478 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-22 21:45:41,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,576 INFO L478 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-22 21:45:41,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,583 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-22 21:45:41,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-11-22 21:45:41,642 INFO L478 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 45 treesize of output 28 [2018-11-22 21:45:41,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,645 INFO L478 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-22 21:45:41,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,653 INFO L478 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 29 treesize of output 30 [2018-11-22 21:45:41,655 INFO L478 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-22 21:45:41,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:32 [2018-11-22 21:45:41,700 INFO L478 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-22 21:45:41,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,738 INFO L478 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 3 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 118 [2018-11-22 21:45:41,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 24 xjuncts. [2018-11-22 21:45:41,861 INFO L478 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 60 treesize of output 59 [2018-11-22 21:45:41,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,864 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:41,865 INFO L478 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 40 [2018-11-22 21:45:41,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,877 INFO L478 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 69 treesize of output 68 [2018-11-22 21:45:41,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-22 21:45:41,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-22 21:45:41,895 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:41,896 INFO L478 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 20 treesize of output 21 [2018-11-22 21:45:41,897 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,902 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,906 INFO L478 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 62 treesize of output 71 [2018-11-22 21:45:41,908 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:45:41,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-22 21:45:41,909 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,916 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2018-11-22 21:45:41,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-22 21:45:41,929 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-22 21:45:41,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:45:41,946 INFO L478 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 53 treesize of output 52 [2018-11-22 21:45:41,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:41,949 INFO L478 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-22 21:45:41,949 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,958 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:41,962 INFO L478 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-22 21:45:41,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-22 21:45:41,970 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-22 21:45:41,981 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:45:42,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-22 21:45:42,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-11-22 21:45:42,072 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:91, output treesize:351 [2018-11-22 21:45:42,447 INFO L478 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 46 treesize of output 40 [2018-11-22 21:45:42,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-22 21:45:42,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 20 [2018-11-22 21:45:42,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,535 INFO L478 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 64 treesize of output 54 [2018-11-22 21:45:42,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,541 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 47 [2018-11-22 21:45:42,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-22 21:45:42,550 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,612 INFO L478 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 81 treesize of output 65 [2018-11-22 21:45:42,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-22 21:45:42,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 108 [2018-11-22 21:45:42,652 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 5 xjuncts. [2018-11-22 21:45:42,673 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,721 INFO L478 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 73 treesize of output 61 [2018-11-22 21:45:42,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-22 21:45:42,724 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,739 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 47 [2018-11-22 21:45:42,739 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,746 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,788 INFO L478 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 63 treesize of output 55 [2018-11-22 21:45:42,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-22 21:45:42,795 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 69 [2018-11-22 21:45:42,825 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-11-22 21:45:42,835 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,875 INFO L478 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 55 treesize of output 47 [2018-11-22 21:45:42,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 20 [2018-11-22 21:45:42,882 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:45:42,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-22 21:45:42,896 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,904 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:42,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 6 xjuncts. [2018-11-22 21:45:42,933 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 24 variables, input treesize:383, output treesize:76 [2018-11-22 21:45:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-22 21:45:43,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:45:43,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 45 [2018-11-22 21:45:43,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:45:43,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash -877842931, now seen corresponding path program 8 times [2018-11-22 21:45:43,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:45:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:45:43,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:43,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:45:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:45:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:45:46,034 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 249 DAG size of output: 179 [2018-11-22 21:45:46,551 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-22 21:45:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-22 21:45:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-11-22 21:45:46,552 INFO L87 Difference]: Start difference. First operand 375 states and 486 transitions. cyclomatic complexity: 119 Second operand 45 states. [2018-11-22 21:45:48,888 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 117 [2018-11-22 21:45:50,965 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2018-11-22 21:46:02,076 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2018-11-22 21:46:04,237 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 127 [2018-11-22 21:46:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:04,977 INFO L93 Difference]: Finished difference Result 807 states and 1065 transitions. [2018-11-22 21:46:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-11-22 21:46:04,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 807 states and 1065 transitions. [2018-11-22 21:46:04,980 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 206 [2018-11-22 21:46:04,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 807 states to 557 states and 719 transitions. [2018-11-22 21:46:04,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2018-11-22 21:46:04,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 544 [2018-11-22 21:46:04,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 557 states and 719 transitions. [2018-11-22 21:46:04,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:46:04,982 INFO L705 BuchiCegarLoop]: Abstraction has 557 states and 719 transitions. [2018-11-22 21:46:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states and 719 transitions. [2018-11-22 21:46:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 341. [2018-11-22 21:46:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-22 21:46:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 435 transitions. [2018-11-22 21:46:04,986 INFO L728 BuchiCegarLoop]: Abstraction has 341 states and 435 transitions. [2018-11-22 21:46:04,986 INFO L608 BuchiCegarLoop]: Abstraction has 341 states and 435 transitions. [2018-11-22 21:46:04,986 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-22 21:46:04,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 435 transitions. [2018-11-22 21:46:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 114 [2018-11-22 21:46:04,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:46:04,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:46:04,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:04,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 2, 1, 1, 1] [2018-11-22 21:46:04,988 INFO L794 eck$LassoCheckResult]: Stem: 23483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 23480#L-1 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; 23465#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 23466#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;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; 23470#L545-3 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); 23481#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23482#L545-3 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); 23478#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23479#L545-3 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); 23493#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23492#L545-3 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); 23491#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23490#L545-3 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); 23489#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23488#L545-3 assume !(lis_~i~0 < lis_~N); 23485#L545-4 lis_~i~0 := 1; 23486#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23508#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23529#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; 23527#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 23525#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23523#L548-3 assume !(lis_~j~0 < lis_~i~0); 23519#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 23520#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23548#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23547#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; 23545#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 23544#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23542#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23543#L549 assume !lis_#t~short11; 23502#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 23498#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23499#L548-3 assume !(lis_~j~0 < lis_~i~0); 23471#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 23472#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23647#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23644#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; 23645#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 23718#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23777#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23776#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; 23705#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 23650#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23651#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23772#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; 23584#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 23553#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23583#L548-3 assume !(lis_~j~0 < lis_~i~0); 23749#L547-2 [2018-11-22 21:46:04,988 INFO L796 eck$LassoCheckResult]: Loop: 23749#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 23748#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23747#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23745#L549 assume !lis_#t~short11; 23744#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 23743#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23741#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23742#L549 assume !lis_#t~short11; 23792#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 23725#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23789#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23788#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; 23786#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 23785#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23784#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 23770#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; 23780#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 23778#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23769#L548-3 assume !(lis_~j~0 < lis_~i~0); 23749#L547-2 [2018-11-22 21:46:04,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash 618667987, now seen corresponding path program 14 times [2018-11-22 21:46:04,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:04,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:04,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:05,364 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 27 [2018-11-22 21:46:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 21:46:06,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:46:06,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:46:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:46:06,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:46:06,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:46:06,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:46:06,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,080 INFO L478 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-22 21:46:06,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,097 INFO L478 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-22 21:46:06,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,107 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-22 21:46:06,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-22 21:46:06,186 INFO L478 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-22 21:46:06,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,190 INFO L478 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-22 21:46:06,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,199 INFO L478 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-22 21:46:06,200 INFO L478 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-22 21:46:06,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,208 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-22 21:46:06,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-11-22 21:46:06,295 INFO L478 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-22 21:46:06,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,297 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:46:06,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,301 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:46:06,302 INFO L478 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-22 21:46:06,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,320 INFO L478 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-22 21:46:06,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:06,323 INFO L478 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-22 21:46:06,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:06,336 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-22 21:46:06,346 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-22 21:46:06,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:74 [2018-11-22 21:46:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 13 proven. 85 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 21:46:06,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:46:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 36 [2018-11-22 21:46:06,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:46:06,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1929337569, now seen corresponding path program 6 times [2018-11-22 21:46:06,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:06,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:06,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:07,051 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2018-11-22 21:46:07,157 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-22 21:46:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-22 21:46:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2018-11-22 21:46:07,158 INFO L87 Difference]: Start difference. First operand 341 states and 435 transitions. cyclomatic complexity: 100 Second operand 36 states. [2018-11-22 21:46:09,948 WARN L180 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2018-11-22 21:46:10,671 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-22 21:46:11,372 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2018-11-22 21:46:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:13,210 INFO L93 Difference]: Finished difference Result 557 states and 718 transitions. [2018-11-22 21:46:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-22 21:46:13,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 557 states and 718 transitions. [2018-11-22 21:46:13,211 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 226 [2018-11-22 21:46:13,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 557 states to 557 states and 718 transitions. [2018-11-22 21:46:13,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 547 [2018-11-22 21:46:13,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 547 [2018-11-22 21:46:13,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 557 states and 718 transitions. [2018-11-22 21:46:13,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:46:13,214 INFO L705 BuchiCegarLoop]: Abstraction has 557 states and 718 transitions. [2018-11-22 21:46:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states and 718 transitions. [2018-11-22 21:46:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 492. [2018-11-22 21:46:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-22 21:46:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 641 transitions. [2018-11-22 21:46:13,220 INFO L728 BuchiCegarLoop]: Abstraction has 492 states and 641 transitions. [2018-11-22 21:46:13,220 INFO L608 BuchiCegarLoop]: Abstraction has 492 states and 641 transitions. [2018-11-22 21:46:13,220 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-22 21:46:13,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states and 641 transitions. [2018-11-22 21:46:13,222 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2018-11-22 21:46:13,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:46:13,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:46:13,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:13,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 1, 1, 1] [2018-11-22 21:46:13,223 INFO L794 eck$LassoCheckResult]: Stem: 24693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 24690#L-1 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; 24675#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 24676#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;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; 24681#L545-3 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); 24691#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24692#L545-3 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); 24688#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24689#L545-3 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); 24703#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24702#L545-3 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); 24701#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24700#L545-3 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); 24699#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24698#L545-3 assume !(lis_~i~0 < lis_~N); 24695#L545-4 lis_~i~0 := 1; 24696#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24719#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24740#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; 24738#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24736#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24734#L548-3 assume !(lis_~j~0 < lis_~i~0); 24730#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24728#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24726#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24723#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; 24720#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24721#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24747#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24714#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; 24715#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24801#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24800#L548-3 assume !(lis_~j~0 < lis_~i~0); 24799#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24798#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24797#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24795#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; 24793#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24788#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24789#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24779#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; 24780#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 25164#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25163#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25162#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; 24767#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 24766#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25129#L548-3 assume !(lis_~j~0 < lis_~i~0); 25035#L547-2 [2018-11-22 21:46:13,223 INFO L796 eck$LassoCheckResult]: Loop: 25035#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25034#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25033#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25031#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; 25026#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 25027#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25104#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25102#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; 24895#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 25017#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25136#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 25135#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; 25134#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24879#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24818#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24819#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; 24823#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 24824#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25130#L548-3 assume !(lis_~j~0 < lis_~i~0); 25035#L547-2 [2018-11-22 21:46:13,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1768218223, now seen corresponding path program 4 times [2018-11-22 21:46:13,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:13,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 21:46:14,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:46:14,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:46:14,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 21:46:14,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 21:46:14,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:46:14,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:46:14,056 INFO L478 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-22 21:46:14,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,063 INFO L478 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-22 21:46:14,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,071 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-22 21:46:14,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-22 21:46:14,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-11-22 21:46:14,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 48 [2018-11-22 21:46:14,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-22 21:46:14,169 INFO L478 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-22 21:46:14,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,177 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-22 21:46:14,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:38 [2018-11-22 21:46:14,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2018-11-22 21:46:14,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 137 [2018-11-22 21:46:14,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-11-22 21:46:14,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,305 INFO L478 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-22 21:46:14,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,326 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-22 21:46:14,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:96, output treesize:69 [2018-11-22 21:46:14,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2018-11-22 21:46:14,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,422 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:46:14,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,442 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:46:14,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 171 [2018-11-22 21:46:14,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:14,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 83 [2018-11-22 21:46:14,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-22 21:46:14,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:14,486 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-22 21:46:14,494 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-22 21:46:14,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:71 [2018-11-22 21:46:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 21:46:14,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:46:14,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 36 [2018-11-22 21:46:14,600 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:46:14,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1023927711, now seen corresponding path program 9 times [2018-11-22 21:46:14,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:14,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:17,236 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 245 DAG size of output: 178 [2018-11-22 21:46:17,744 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-22 21:46:17,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-22 21:46:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2018-11-22 21:46:17,745 INFO L87 Difference]: Start difference. First operand 492 states and 641 transitions. cyclomatic complexity: 158 Second operand 36 states. [2018-11-22 21:46:19,235 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2018-11-22 21:46:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:20,864 INFO L93 Difference]: Finished difference Result 1010 states and 1313 transitions. [2018-11-22 21:46:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-22 21:46:20,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1010 states and 1313 transitions. [2018-11-22 21:46:20,866 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 652 [2018-11-22 21:46:20,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1010 states to 1006 states and 1309 transitions. [2018-11-22 21:46:20,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 996 [2018-11-22 21:46:20,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 996 [2018-11-22 21:46:20,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1006 states and 1309 transitions. [2018-11-22 21:46:20,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:46:20,868 INFO L705 BuchiCegarLoop]: Abstraction has 1006 states and 1309 transitions. [2018-11-22 21:46:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states and 1309 transitions. [2018-11-22 21:46:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 617. [2018-11-22 21:46:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-22 21:46:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 810 transitions. [2018-11-22 21:46:20,877 INFO L728 BuchiCegarLoop]: Abstraction has 617 states and 810 transitions. [2018-11-22 21:46:20,877 INFO L608 BuchiCegarLoop]: Abstraction has 617 states and 810 transitions. [2018-11-22 21:46:20,877 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-22 21:46:20,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 617 states and 810 transitions. [2018-11-22 21:46:20,878 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 323 [2018-11-22 21:46:20,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:46:20,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:46:20,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:20,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-11-22 21:46:20,879 INFO L794 eck$LassoCheckResult]: Stem: 26469#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 26466#L-1 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; 26451#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 26452#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;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; 26457#L545-3 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); 26467#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26468#L545-3 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); 26463#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26464#L545-3 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); 26481#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26480#L545-3 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); 26479#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26478#L545-3 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); 26477#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26476#L545-3 assume !(lis_~i~0 < lis_~N); 26471#L545-4 lis_~i~0 := 1; 26472#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26498#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26519#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; 26517#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26515#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26513#L548-3 assume !(lis_~j~0 < lis_~i~0); 26509#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26507#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26505#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26502#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; 26499#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26500#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26526#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26494#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; 26490#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26491#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26576#L548-3 assume !(lis_~j~0 < lis_~i~0); 26575#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26574#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26573#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26571#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; 26560#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26561#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26556#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26557#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; 26786#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26830#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26829#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26828#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; 26826#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26824#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26821#L548-3 assume !(lis_~j~0 < lis_~i~0); 26820#L547-2 [2018-11-22 21:46:20,879 INFO L796 eck$LassoCheckResult]: Loop: 26820#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26819#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26818#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26816#L549 assume !lis_#t~short11; 26817#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 26854#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26853#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26852#L549 assume !lis_#t~short11; 26811#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 26844#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26843#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26842#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; 26840#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10;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); 26790#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26836#L548-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 26835#L549 assume !lis_#t~short11; 26833#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem10; 26832#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26822#L548-3 assume !(lis_~j~0 < lis_~i~0); 26820#L547-2 [2018-11-22 21:46:20,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1768220145, now seen corresponding path program 8 times [2018-11-22 21:46:20,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:20,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:20,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1929399073, now seen corresponding path program 7 times [2018-11-22 21:46:20,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:46:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:46:20,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash 52734547, now seen corresponding path program 15 times [2018-11-22 21:46:20,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:46:20,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:46:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 44 proven. 200 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 21:46:22,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:46:22,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7758150-3e75-4680-83e7-4a4dcb380dea/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-22 21:46:22,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:46:23,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-22 21:46:23,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:46:23,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:46:23,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,146 INFO L478 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-22 21:46:23,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,161 INFO L478 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-22 21:46:23,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-22 21:46:23,414 INFO L478 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-22 21:46:23,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,417 INFO L478 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-22 21:46:23,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,441 INFO L478 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-22 21:46:23,442 INFO L478 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-22 21:46:23,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,454 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-22 21:46:23,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:90, output treesize:67 [2018-11-22 21:46:23,519 INFO L478 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 105 treesize of output 89 [2018-11-22 21:46:23,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 84 [2018-11-22 21:46:23,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:46:23,570 INFO L478 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 65 treesize of output 72 [2018-11-22 21:46:23,572 INFO L478 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-22 21:46:23,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,587 INFO L478 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 72 treesize of output 89 [2018-11-22 21:46:23,590 INFO L478 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-22 21:46:23,590 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,617 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-22 21:46:23,640 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-22 21:46:23,640 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:126, output treesize:140 [2018-11-22 21:46:23,809 INFO L478 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 130 treesize of output 102 [2018-11-22 21:46:23,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,840 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 171 [2018-11-22 21:46:23,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-22 21:46:23,916 INFO L478 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 75 treesize of output 82 [2018-11-22 21:46:23,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,920 INFO L478 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 31 treesize of output 58 [2018-11-22 21:46:23,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,938 INFO L478 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 85 treesize of output 92 [2018-11-22 21:46:23,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,941 INFO L478 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 31 treesize of output 45 [2018-11-22 21:46:23,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,952 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,960 INFO L478 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 86 treesize of output 93 [2018-11-22 21:46:23,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,965 INFO L478 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 42 treesize of output 56 [2018-11-22 21:46:23,965 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:23,984 INFO L478 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 97 treesize of output 102 [2018-11-22 21:46:23,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:23,987 INFO L478 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 61 treesize of output 77 [2018-11-22 21:46:23,987 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,000 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-22 21:46:24,230 INFO L478 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 135 treesize of output 107 [2018-11-22 21:46:24,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,259 INFO L478 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 119 [2018-11-22 21:46:24,261 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-11-22 21:46:24,332 INFO L478 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 80 treesize of output 87 [2018-11-22 21:46:24,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-22 21:46:24,336 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,347 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,355 INFO L478 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 89 treesize of output 96 [2018-11-22 21:46:24,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 56 [2018-11-22 21:46:24,360 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,382 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,389 INFO L478 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 92 treesize of output 99 [2018-11-22 21:46:24,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,393 INFO L478 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 29 treesize of output 56 [2018-11-22 21:46:24,393 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,407 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,415 INFO L478 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 91 treesize of output 98 [2018-11-22 21:46:24,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-22 21:46:24,419 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,432 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:24,483 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-22 21:46:24,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-22 21:46:24,645 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:266, output treesize:802 [2018-11-22 21:46:24,851 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-22 21:46:24,869 INFO L478 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 159 treesize of output 127 [2018-11-22 21:46:24,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:24,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 73 treesize of output 248 [2018-11-22 21:46:24,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-22 21:46:25,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:25,053 INFO L478 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 126 treesize of output 139 [2018-11-22 21:46:25,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:25,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-11-22 21:46:25,058 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:25,082 INFO L478 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 124 treesize of output 137 [2018-11-22 21:46:25,085 INFO L478 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 96 treesize of output 92 [2018-11-22 21:46:25,085 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,109 INFO L478 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 125 treesize of output 128 [2018-11-22 21:46:25,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:25,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 92 [2018-11-22 21:46:25,114 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,130 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:25,139 INFO L478 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 127 treesize of output 130 [2018-11-22 21:46:25,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:25,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 89 [2018-11-22 21:46:25,145 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:25,158 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:25,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-22 21:46:44,402 INFO L478 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 159 treesize of output 131 [2018-11-22 21:46:44,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 99 [2018-11-22 21:46:44,426 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-11-22 21:46:44,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,465 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:46:44,466 INFO L478 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 98 treesize of output 120 [2018-11-22 21:46:44,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2018-11-22 21:46:44,471 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:44,484 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:44,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,492 INFO L478 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 88 treesize of output 103 [2018-11-22 21:46:44,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:44,497 INFO L478 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 52 treesize of output 60 [2018-11-22 21:46:44,497 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:44,510 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:44,535 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:46:55,239 INFO L478 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 164 treesize of output 132 [2018-11-22 21:46:55,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 196 [2018-11-22 21:46:55,298 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 9 xjuncts. [2018-11-22 21:46:55,406 INFO L478 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 119 treesize of output 124 [2018-11-22 21:46:55,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2018-11-22 21:46:55,413 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:55,427 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:55,435 INFO L478 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 130 treesize of output 133 [2018-11-22 21:46:55,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-11-22 21:46:55,443 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,460 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,469 INFO L478 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-22 21:46:55,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,474 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 116 [2018-11-22 21:46:55,485 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,504 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,513 INFO L478 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 118 treesize of output 133 [2018-11-22 21:46:55,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:46:55,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-11-22 21:46:55,519 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,538 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:55,602 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-22 21:47:03,810 INFO L478 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 151 treesize of output 123 [2018-11-22 21:47:03,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 120 [2018-11-22 21:47:03,833 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-11-22 21:47:03,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,874 INFO L478 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 92 treesize of output 107 [2018-11-22 21:47:03,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-11-22 21:47:03,879 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:03,892 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:03,900 INFO L478 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 93 treesize of output 98 [2018-11-22 21:47:03,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:03,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2018-11-22 21:47:03,906 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:03,916 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:03,943 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:47:07,956 INFO L478 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 170 treesize of output 142 [2018-11-22 21:47:07,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:07,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:07,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:07,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:07,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:07,984 INFO L478 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 48 treesize of output 160 [2018-11-22 21:47:07,985 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-22 21:47:08,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:08,036 INFO L478 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 122 treesize of output 135 [2018-11-22 21:47:08,040 INFO L478 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 84 treesize of output 81 [2018-11-22 21:47:08,041 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:08,055 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:08,062 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:47:08,063 INFO L478 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 112 treesize of output 124 [2018-11-22 21:47:08,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 80 [2018-11-22 21:47:08,066 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:08,079 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:08,108 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:10,417 INFO L478 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 150 treesize of output 122 [2018-11-22 21:47:10,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:10,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:10,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 84 [2018-11-22 21:47:10,438 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-11-22 21:47:10,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:10,479 INFO L478 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 86 treesize of output 101 [2018-11-22 21:47:10,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:10,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-22 21:47:10,482 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:10,494 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:10,500 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:47:10,502 INFO L478 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 98 treesize of output 112 [2018-11-22 21:47:10,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:10,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-22 21:47:10,505 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:10,519 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:10,546 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:12,175 INFO L478 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 164 treesize of output 136 [2018-11-22 21:47:12,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,205 INFO L478 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 35 treesize of output 108 [2018-11-22 21:47:12,205 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-22 21:47:12,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,258 INFO L478 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 114 treesize of output 129 [2018-11-22 21:47:12,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,274 INFO L478 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 52 treesize of output 60 [2018-11-22 21:47:12,274 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:12,291 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:12,297 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:47:12,299 INFO L478 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 104 treesize of output 118 [2018-11-22 21:47:12,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:12,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-11-22 21:47:12,303 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:12,319 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:12,354 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-22 21:47:13,291 INFO L478 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 144 treesize of output 116 [2018-11-22 21:47:13,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:13,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:13,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:13,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 120 [2018-11-22 21:47:13,314 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-11-22 21:47:13,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:13,355 INFO L478 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 90 treesize of output 105 [2018-11-22 21:47:13,358 INFO L478 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 64 treesize of output 66 [2018-11-22 21:47:13,358 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:13,372 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:13,380 INFO L478 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 91 treesize of output 96 [2018-11-22 21:47:13,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:13,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2018-11-22 21:47:13,385 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:13,397 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:13,424 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:47:13,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 8 dim-0 vars, and 18 xjuncts. [2018-11-22 21:47:13,980 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 16 variables, input treesize:1262, output treesize:1933 [2018-11-22 21:47:14,578 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 91 [2018-11-22 21:47:14,610 INFO L478 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 129 treesize of output 109 [2018-11-22 21:47:14,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:14,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:14,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:14,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 100 [2018-11-22 21:47:14,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-22 21:47:14,692 INFO L478 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 83 treesize of output 88 [2018-11-22 21:47:14,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:14,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2018-11-22 21:47:14,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:14,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:14,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:14,726 INFO L478 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 82 treesize of output 97 [2018-11-22 21:47:14,729 INFO L478 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 60 treesize of output 62 [2018-11-22 21:47:14,729 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:14,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:14,777 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-22 21:49:05,898 INFO L478 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 136 treesize of output 120 [2018-11-22 21:49:05,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 100 [2018-11-22 21:49:05,920 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-22 21:49:05,956 INFO L478 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 85 treesize of output 90 [2018-11-22 21:49:05,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-11-22 21:49:05,961 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:05,970 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:05,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,977 INFO L478 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 84 treesize of output 99 [2018-11-22 21:49:05,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:05,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2018-11-22 21:49:05,982 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-22 21:49:06,001 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-22 21:49:06,023 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-22 21:50:23,262 INFO L478 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 148 treesize of output 124 [2018-11-22 21:50:23,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 166 [2018-11-22 21:50:23,311 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-11-22 21:50:23,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,407 INFO L478 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 107 treesize of output 122 [2018-11-22 21:50:23,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2018-11-22 21:50:23,413 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,429 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,436 INFO L478 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 108 treesize of output 113 [2018-11-22 21:50:23,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-11-22 21:50:23,443 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:50:23,455 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:50:23,462 INFO L478 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 120 [2018-11-22 21:50:23,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-11-22 21:50:23,469 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,484 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,491 INFO L478 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 116 treesize of output 129 [2018-11-22 21:50:23,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:50:23,496 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 109 [2018-11-22 21:50:23,497 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,514 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:50:23,568 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-22 21:51:10,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,722 INFO L478 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 135 treesize of output 125 [2018-11-22 21:51:10,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,757 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 99 [2018-11-22 21:51:10,759 INFO L267 ElimStorePlain]: Start of recursive call 25: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-11-22 21:51:10,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,851 INFO L478 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-22 21:51:10,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,857 INFO L478 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 48 treesize of output 60 [2018-11-22 21:51:10,857 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,873 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,879 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:51:10,881 INFO L478 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 107 treesize of output 129 [2018-11-22 21:51:10,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-22 21:51:10,886 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,902 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,910 INFO L478 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 98 treesize of output 121 [2018-11-22 21:51:10,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,915 INFO L478 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 48 treesize of output 60 [2018-11-22 21:51:10,916 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,930 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:51:10,937 INFO L478 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-22 21:51:10,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-22 21:51:10,947 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,962 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,971 INFO L478 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 98 treesize of output 113 [2018-11-22 21:51:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,976 INFO L478 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 48 treesize of output 60 [2018-11-22 21:51:10,977 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,989 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:10,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:10,998 INFO L478 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 115 treesize of output 138 [2018-11-22 21:51:11,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,004 INFO L478 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 48 treesize of output 60 [2018-11-22 21:51:11,005 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,021 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,030 INFO L478 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 111 treesize of output 134 [2018-11-22 21:51:11,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,035 INFO L478 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 48 treesize of output 60 [2018-11-22 21:51:11,036 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,051 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,057 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:51:11,059 INFO L478 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 107 treesize of output 129 [2018-11-22 21:51:11,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:11,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-22 21:51:11,064 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,079 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:11,179 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-11-22 21:51:49,891 INFO L478 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 136 treesize of output 112 [2018-11-22 21:51:49,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 76 [2018-11-22 21:51:49,911 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 3 xjuncts. [2018-11-22 21:51:49,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,949 INFO L478 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 90 treesize of output 105 [2018-11-22 21:51:49,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-22 21:51:49,953 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:49,965 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:49,971 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:51:49,973 INFO L478 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 89 treesize of output 103 [2018-11-22 21:51:49,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:51:49,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-22 21:51:49,976 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-22 21:51:49,997 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:51:50,022 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:52:08,016 INFO L478 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 141 treesize of output 117 [2018-11-22 21:52:08,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 62 treesize of output 210 [2018-11-22 21:52:08,070 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 9 xjuncts. [2018-11-22 21:52:08,168 INFO L478 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 110 treesize of output 113 [2018-11-22 21:52:08,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-11-22 21:52:08,172 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,186 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,196 INFO L478 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 111 treesize of output 124 [2018-11-22 21:52:08,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-11-22 21:52:08,200 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,214 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,222 INFO L478 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 112 treesize of output 115 [2018-11-22 21:52:08,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-11-22 21:52:08,228 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:08,240 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:08,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:08,248 INFO L478 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 109 treesize of output 122 [2018-11-22 21:52:08,251 INFO L478 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 85 treesize of output 81 [2018-11-22 21:52:08,251 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,265 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:52:08,318 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-22 21:52:17,422 INFO L478 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 144 treesize of output 124 [2018-11-22 21:52:17,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,442 INFO L478 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 30 treesize of output 92 [2018-11-22 21:52:17,443 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-22 21:52:17,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,489 INFO L478 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 101 treesize of output 116 [2018-11-22 21:52:17,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,495 INFO L478 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 52 treesize of output 60 [2018-11-22 21:52:17,495 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:17,508 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:17,512 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:52:17,516 INFO L478 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 91 treesize of output 105 [2018-11-22 21:52:17,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:17,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-11-22 21:52:17,520 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:17,532 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:17,560 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:52:21,714 INFO L478 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 143 treesize of output 123 [2018-11-22 21:52:21,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 76 [2018-11-22 21:52:21,736 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 3 xjuncts. [2018-11-22 21:52:21,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,773 INFO L478 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 92 treesize of output 107 [2018-11-22 21:52:21,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,778 INFO L478 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 52 treesize of output 60 [2018-11-22 21:52:21,778 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:21,791 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:21,796 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:52:21,797 INFO L478 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 91 treesize of output 105 [2018-11-22 21:52:21,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:21,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2018-11-22 21:52:21,801 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:21,813 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:21,838 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:52:23,991 INFO L478 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 144 treesize of output 124 [2018-11-22 21:52:23,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:23,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:24,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:24,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:24,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:24,014 INFO L478 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 41 treesize of output 136 [2018-11-22 21:52:24,015 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-11-22 21:52:24,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:24,063 INFO L478 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 107 treesize of output 120 [2018-11-22 21:52:24,067 INFO L478 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 73 treesize of output 74 [2018-11-22 21:52:24,067 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:24,081 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:24,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:52:24,088 INFO L478 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 97 treesize of output 109 [2018-11-22 21:52:24,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-11-22 21:52:24,091 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:24,102 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:24,130 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:52:25,503 INFO L478 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 138 treesize of output 118 [2018-11-22 21:52:25,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 82 [2018-11-22 21:52:25,523 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 3 xjuncts. [2018-11-22 21:52:25,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,560 INFO L478 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 82 treesize of output 97 [2018-11-22 21:52:25,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-22 21:52:25,563 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:25,573 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:25,579 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:52:25,579 INFO L478 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 91 treesize of output 105 [2018-11-22 21:52:25,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:52:25,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-22 21:52:25,583 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-22 21:52:25,594 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:52:25,617 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:52:26,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 42 dim-0 vars, 10 dim-2 vars, End of recursive call: 106 dim-0 vars, and 30 xjuncts. [2018-11-22 21:52:26,695 INFO L202 ElimStorePlain]: Needed 81 recursive calls to eliminate 52 variables, input treesize:1395, output treesize:3016 [2018-11-22 21:52:33,320 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-22 21:52:33,321 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.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) 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) ... 39 more [2018-11-22 21:52:33,323 INFO L168 Benchmark]: Toolchain (without parser) took 652863.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 956.6 MB in the beginning and 929.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 364.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:52:33,323 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:52:33,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:52:33,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.71 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:52:33,324 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 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-22 21:52:33,324 INFO L168 Benchmark]: RCFGBuilder took 275.53 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: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:52:33,324 INFO L168 Benchmark]: BuchiAutomizer took 652180.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 195.1 MB). Peak memory consumption was 360.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:52:33,325 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.71 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.43 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 275.53 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: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 652180.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 195.1 MB). Peak memory consumption was 360.8 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 * 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...