./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-635dfa2 [2018-12-02 14:29:59,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:29:59,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:29:59,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:29:59,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:29:59,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:29:59,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:29:59,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:29:59,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:29:59,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:29:59,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:29:59,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:29:59,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:29:59,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:29:59,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:29:59,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:29:59,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:29:59,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:29:59,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:29:59,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:29:59,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:29:59,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:29:59,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:29:59,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:29:59,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:29:59,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:29:59,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:29:59,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:29:59,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:29:59,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:29:59,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:29:59,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:29:59,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:29:59,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:29:59,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:29:59,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:29:59,912 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 14:29:59,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:29:59,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:29:59,923 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:29:59,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:29:59,924 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:29:59,924 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 14:29:59,924 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 14:29:59,924 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 14:29:59,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:29:59,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 14:29:59,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 14:29:59,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:29:59,927 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 14:29:59,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:29:59,928 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:29:59,928 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 14:29:59,929 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 14:29:59,929 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_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:29:59,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:29:59,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:29:59,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:29:59,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:29:59,961 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:29:59,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:29:59,998 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/data/dba0c204e/9c77b1d54367441b9c38d137f26d90c1/FLAGbfcc33999 [2018-12-02 14:30:00,343 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:30:00,344 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:30:00,350 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/data/dba0c204e/9c77b1d54367441b9c38d137f26d90c1/FLAGbfcc33999 [2018-12-02 14:30:00,358 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/data/dba0c204e/9c77b1d54367441b9c38d137f26d90c1 [2018-12-02 14:30:00,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:30:00,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:30:00,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:00,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:30:00,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:30:00,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00, skipping insertion in model container [2018-12-02 14:30:00,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:30:00,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:30:00,528 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:00,578 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:30:00,601 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:00,620 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:30:00,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00 WrapperNode [2018-12-02 14:30:00,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:00,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:00,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:30:00,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:30:00,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:00,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:30:00,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:30:00,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:30:00,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... [2018-12-02 14:30:00,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:30:00,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:30:00,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:30:00,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:30:00,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:30:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:30:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:30:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:30:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:30:00,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:30:00,832 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:30:00,833 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-02 14:30:00,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:00 BoogieIcfgContainer [2018-12-02 14:30:00,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:30:00,833 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 14:30:00,833 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 14:30:00,835 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 14:30:00,836 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:30:00,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:30:00" (1/3) ... [2018-12-02 14:30:00,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e8961b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:30:00, skipping insertion in model container [2018-12-02 14:30:00,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:30:00,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:00" (2/3) ... [2018-12-02 14:30:00,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e8961b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:30:00, skipping insertion in model container [2018-12-02 14:30:00,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:30:00,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:00" (3/3) ... [2018-12-02 14:30:00,838 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:30:00,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:30:00,869 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 14:30:00,869 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 14:30:00,869 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 14:30:00,870 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:30:00,870 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:30:00,870 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 14:30:00,870 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:30:00,870 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 14:30:00,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-02 14:30:00,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-02 14:30:00,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:00,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:00,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 14:30:00,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:30:00,894 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 14:30:00,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-02 14:30:00,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-02 14:30:00,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:00,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:00,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 14:30:00,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:30:00,901 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-12-02 14:30:00,901 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-12-02 14:30:00,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-02 14:30:00,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:00,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:00,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2018-12-02 14:30:00,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:00,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:00,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2018-12-02 14:30:00,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:01,233 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:01,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:01,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:01,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:01,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:01,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:01,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:01,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:01,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-02 14:30:01,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:01,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:01,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-12-02 14:30:01,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:01,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:01,712 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:01,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,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-12-02 14:30:01,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,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-12-02 14:30:01,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,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-12-02 14:30:01,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:01,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:01,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:01,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,786 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:30:01,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:30:01,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:01,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:01,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:01,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:01,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:01,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:01,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:01,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:01,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:01,899 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 14:30:01,900 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 14:30:01,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:01,903 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:30:01,903 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:01,904 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-12-02 14:30:01,948 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-02 14:30:01,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:01,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:01,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,004 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-12-02 14:30:02,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-12-02 14:30:02,034 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-12-02 14:30:02,034 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-12-02 14:30:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:30:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-12-02 14:30:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 14:30:02,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-02 14:30:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-02 14:30:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2018-12-02 14:30:02,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 14:30:02,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2018-12-02 14:30:02,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 14:30:02,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 14:30:02,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2018-12-02 14:30:02,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:30:02,045 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-02 14:30:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2018-12-02 14:30:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 14:30:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 14:30:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-12-02 14:30:02,062 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-02 14:30:02,062 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-02 14:30:02,062 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 14:30:02,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2018-12-02 14:30:02,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 14:30:02,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:02,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:02,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 14:30:02,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:30:02,063 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-12-02 14:30:02,063 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-12-02 14:30:02,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2018-12-02 14:30:02,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:30:02,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:30:02,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:02,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2018-12-02 14:30:02,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,114 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:02,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:02,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:02,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:02,114 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 14:30:02,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:02,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:02,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:02,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-02 14:30:02,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:02,114 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:02,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:02,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:02,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:02,144 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:02,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:30:02,150 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:02,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 14:30:02,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:30:02,291 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 14:30:02,292 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:02,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:02,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:02,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:02,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:02,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:02,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:02,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:02,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-02 14:30:02,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:02,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:02,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:02,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:02,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:02,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:02,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:02,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:02,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:02,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:02,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:02,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:02,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:02,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:02,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:02,320 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 14:30:02,320 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 14:30:02,321 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:02,321 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 14:30:02,321 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:02,321 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-12-02 14:30:02,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 14:30:02,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,362 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-12-02 14:30:02,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-02 14:30:02,422 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-12-02 14:30:02,423 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-12-02 14:30:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 14:30:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-12-02 14:30:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 14:30:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-02 14:30:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-02 14:30:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:02,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2018-12-02 14:30:02,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 14:30:02,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2018-12-02 14:30:02,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 14:30:02,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 14:30:02,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2018-12-02 14:30:02,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:02,428 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2018-12-02 14:30:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2018-12-02 14:30:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-12-02 14:30:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 14:30:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-02 14:30:02,430 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-02 14:30:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:30:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:30:02,434 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-12-02 14:30:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:02,468 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2018-12-02 14:30:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:30:02,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2018-12-02 14:30:02,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:02,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2018-12-02 14:30:02,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 14:30:02,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 14:30:02,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-12-02 14:30:02,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:02,470 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-12-02 14:30:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-12-02 14:30:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 14:30:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 14:30:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-12-02 14:30:02,471 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-12-02 14:30:02,471 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-12-02 14:30:02,471 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 14:30:02,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2018-12-02 14:30:02,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:02,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:02,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:02,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:02,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:02,472 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-12-02 14:30:02,472 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~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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-12-02 14:30:02,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2018-12-02 14:30:02,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:02,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:02,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:02,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 14:30:02,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:02,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2018-12-02 14:30:02,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,710 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-02 14:30:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:30:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:30:02,758 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-12-02 14:30:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:02,814 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2018-12-02 14:30:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:30:02,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2018-12-02 14:30:02,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 14:30:02,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2018-12-02 14:30:02,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 14:30:02,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 14:30:02,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2018-12-02 14:30:02,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:02,816 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2018-12-02 14:30:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2018-12-02 14:30:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-12-02 14:30:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 14:30:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-12-02 14:30:02,817 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-02 14:30:02,817 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-02 14:30:02,818 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 14:30:02,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-12-02 14:30:02,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:02,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:02,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:02,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:02,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:02,819 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-12-02 14:30:02,819 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~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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-12-02 14:30:02,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2018-12-02 14:30:02,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2018-12-02 14:30:02,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:02,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2018-12-02 14:30:02,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:02,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:02,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:02,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:02,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:02,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:02,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-02 14:30:03,093 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-12-02 14:30:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 14:30:03,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:30:03,131 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2018-12-02 14:30:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:03,303 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2018-12-02 14:30:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 14:30:03,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2018-12-02 14:30:03,306 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2018-12-02 14:30:03,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2018-12-02 14:30:03,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-12-02 14:30:03,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-02 14:30:03,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2018-12-02 14:30:03,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:03,307 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2018-12-02 14:30:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2018-12-02 14:30:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2018-12-02 14:30:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 14:30:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-12-02 14:30:03,310 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-02 14:30:03,310 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-02 14:30:03,310 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 14:30:03,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-12-02 14:30:03,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 14:30:03,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:03,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:03,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:03,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:30:03,311 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-12-02 14:30:03,311 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~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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-12-02 14:30:03,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2018-12-02 14:30:03,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:03,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2018-12-02 14:30:03,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:03,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:03,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2018-12-02 14:30:03,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:03,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:03,471 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-12-02 14:30:03,778 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2018-12-02 14:30:03,862 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:03,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:03,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:03,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:03,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:03,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:03,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:03,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:03,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-02 14:30:03,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:03,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:03,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:03,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,278 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-12-02 14:30:04,426 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-12-02 14:30:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:04,578 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-02 14:30:04,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:04,838 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:04,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:04,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:04,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:04,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:04,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:04,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:04,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:04,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,854 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:30:04,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:30:04,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:04,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:04,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:04,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:04,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:04,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:04,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:04,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:04,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:04,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:04,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:04,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:04,907 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:30:04,907 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 14:30:04,907 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:04,908 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:30:04,908 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:04,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-12-02 14:30:05,015 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2018-12-02 14:30:05,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:05,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:05,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:05,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-02 14:30:05,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-02 14:30:05,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 65 states and 98 transitions. Complement of second has 9 states. [2018-12-02 14:30:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 14:30:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 14:30:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-02 14:30:05,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 14:30:05,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:05,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 14:30:05,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:05,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-02 14:30:05,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:05,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2018-12-02 14:30:05,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:05,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2018-12-02 14:30:05,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 14:30:05,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 14:30:05,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2018-12-02 14:30:05,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:05,113 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-12-02 14:30:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2018-12-02 14:30:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-12-02 14:30:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 14:30:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-12-02 14:30:05,115 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-12-02 14:30:05,116 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-12-02 14:30:05,116 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 14:30:05,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2018-12-02 14:30:05,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:05,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:05,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:05,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:05,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:05,117 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#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; 1066#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1067#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; 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); 1085#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1086#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); 1088#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1097#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); 1095#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1094#L545-3 assume !(lis_~i~0 < lis_~N); 1091#L545-4 lis_~i~0 := 1; 1082#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1083#L548-3 assume !(lis_~j~0 < lis_~i~0); 1099#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1098#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-12-02 14:30:05,117 INFO L796 eck$LassoCheckResult]: Loop: 1096#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; 1092#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; 1068#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1069#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1072#L548-3 assume !(lis_~j~0 < lis_~i~0); 1078#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1079#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L548-3 [2018-12-02 14:30:05,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2018-12-02 14:30:05,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:05,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 14:30:05,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:30:05,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:30:05,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:05,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2018-12-02 14:30:05,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,287 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-02 14:30:05,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:30:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:30:05,331 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-12-02 14:30:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:05,352 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2018-12-02 14:30:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:30:05,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2018-12-02 14:30:05,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:05,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2018-12-02 14:30:05,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 14:30:05,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 14:30:05,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2018-12-02 14:30:05,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:05,354 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-12-02 14:30:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2018-12-02 14:30:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-12-02 14:30:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 14:30:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-12-02 14:30:05,355 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-02 14:30:05,355 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-12-02 14:30:05,355 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 14:30:05,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-12-02 14:30:05,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 14:30:05,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:05,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:05,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:05,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:05,356 INFO L794 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1184#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; 1162#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1163#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; 1170#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; 1183#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); 1185#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1193#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); 1192#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1191#L545-3 assume !(lis_~i~0 < lis_~N); 1188#L545-4 lis_~i~0 := 1; 1189#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1171#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; 1172#L549 assume !lis_#t~short11; 1198#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1197#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1196#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-12-02 14:30:05,356 INFO L796 eck$LassoCheckResult]: Loop: 1175#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1176#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1180#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; 1190#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; 1164#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1165#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L548-3 assume !(lis_~j~0 < lis_~i~0); 1175#L547-2 [2018-12-02 14:30:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2018-12-02 14:30:05,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2018-12-02 14:30:05,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:05,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2018-12-02 14:30:05,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 14:30:05,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:05,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:05,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 14:30:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-12-02 14:30:05,611 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-02 14:30:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:30:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:30:05,650 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-12-02 14:30:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:05,713 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-12-02 14:30:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:30:05,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2018-12-02 14:30:05,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 14:30:05,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2018-12-02 14:30:05,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 14:30:05,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 14:30:05,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2018-12-02 14:30:05,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:30:05,714 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-02 14:30:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2018-12-02 14:30:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-02 14:30:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 14:30:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-12-02 14:30:05,716 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-12-02 14:30:05,716 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-12-02 14:30:05,716 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 14:30:05,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-12-02 14:30:05,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-12-02 14:30:05,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:05,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:05,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:05,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:30:05,717 INFO L794 eck$LassoCheckResult]: Stem: 1373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1371#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; 1353#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1354#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; 1362#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); 1369#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1370#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); 1372#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1380#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); 1378#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1377#L545-3 assume !(lis_~i~0 < lis_~N); 1375#L545-4 lis_~i~0 := 1; 1376#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1379#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; 1365#L549 assume !lis_#t~short11; 1357#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1358#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1361#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-12-02 14:30:05,717 INFO L796 eck$LassoCheckResult]: Loop: 1364#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1366#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; 1383#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; 1382#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1359#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1360#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; 1363#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; 1355#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1356#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1381#L548-3 assume !(lis_~j~0 < lis_~i~0); 1364#L547-2 [2018-12-02 14:30:05,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2018-12-02 14:30:05,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2018-12-02 14:30:05,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:05,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:05,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2018-12-02 14:30:05,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:05,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:06,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:06,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:30:06,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:30:06,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:06,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:06,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,321 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-12-02 14:30:06,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,340 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-12-02 14:30:06,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-02 14:30:06,384 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-12-02 14:30:06,386 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-12-02 14:30:06,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,393 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-12-02 14:30:06,395 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-12-02 14:30:06,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-12-02 14:30:06,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, 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-12-02 14:30:06,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,450 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-12-02 14:30:06,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,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, 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-12-02 14:30:06,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,468 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-12-02 14:30:06,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-12-02 14:30:06,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,752 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-12-02 14:30:06,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,759 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:06,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,765 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-12-02 14:30:06,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,791 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-12-02 14:30:06,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:06,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:06,797 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-12-02 14:30:06,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:06,828 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-12-02 14:30:06,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2018-12-02 14:30:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:06,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:06,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-12-02 14:30:07,312 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-12-02 14:30:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 14:30:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-12-02 14:30:07,406 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 28 states. [2018-12-02 14:30:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:09,770 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-12-02 14:30:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 14:30:09,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 134 transitions. [2018-12-02 14:30:09,771 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2018-12-02 14:30:09,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 134 transitions. [2018-12-02 14:30:09,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-12-02 14:30:09,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-12-02 14:30:09,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 134 transitions. [2018-12-02 14:30:09,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:30:09,773 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 134 transitions. [2018-12-02 14:30:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 134 transitions. [2018-12-02 14:30:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2018-12-02 14:30:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 14:30:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-12-02 14:30:09,776 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-02 14:30:09,776 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-02 14:30:09,776 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 14:30:09,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 71 transitions. [2018-12-02 14:30:09,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-02 14:30:09,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:09,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:09,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:09,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:30:09,777 INFO L794 eck$LassoCheckResult]: Stem: 1679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1676#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; 1658#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1659#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; 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); 1677#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1678#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); 1674#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1675#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); 1688#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1687#L545-3 assume !(lis_~i~0 < lis_~N); 1681#L545-4 lis_~i~0 := 1; 1682#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1689#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; 1684#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; 1685#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1663#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1666#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-12-02 14:30:09,777 INFO L796 eck$LassoCheckResult]: Loop: 1669#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1671#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1673#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; 1696#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; 1694#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1664#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1665#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; 1668#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; 1697#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 1661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1693#L548-3 assume !(lis_~j~0 < lis_~i~0); 1669#L547-2 [2018-12-02 14:30:09,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1306550290, now seen corresponding path program 1 times [2018-12-02 14:30:09,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:09,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 6 times [2018-12-02 14:30:09,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:09,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:09,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2097927870, now seen corresponding path program 2 times [2018-12-02 14:30:09,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:09,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:10,209 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-12-02 14:30:12,110 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 227 DAG size of output: 167 [2018-12-02 14:30:12,448 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-12-02 14:30:12,450 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:12,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:12,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:12,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:12,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:12,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:12,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:12,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:12,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration9_Lasso [2018-12-02 14:30:12,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:12,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:12,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:12,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,594 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-12-02 14:30:13,980 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 116 [2018-12-02 14:30:13,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:13,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:14,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:14,374 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:14,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:14,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:14,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:14,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:14,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:14,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:14,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:14,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:14,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:14,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:14,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:14,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:14,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:14,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:14,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:14,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:14,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:14,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:14,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:14,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:14,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:14,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:14,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:14,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:14,392 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:14,397 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 14:30:14,397 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 14:30:14,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:14,398 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:30:14,398 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:14,398 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 Supporting invariants [] [2018-12-02 14:30:14,692 INFO L297 tatePredicateManager]: 69 out of 70 supporting invariants were superfluous and have been removed [2018-12-02 14:30:14,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 14:30:14,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 14:30:14,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:14,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:14,728 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-12-02 14:30:14,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,737 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-12-02 14:30:14,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-02 14:30:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:14,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:14,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,797 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 99 treesize of output 85 [2018-12-02 14:30:14,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:14,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 138 [2018-12-02 14:30:14,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-02 14:30:14,875 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 47 treesize of output 48 [2018-12-02 14:30:14,877 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-12-02 14:30:14,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,885 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 68 treesize of output 69 [2018-12-02 14:30:14,887 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-12-02 14:30:14,887 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,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, 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 68 [2018-12-02 14:30:14,899 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-12-02 14:30:14,899 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,905 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:14,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:30:14,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:30:14,943 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:106, output treesize:192 [2018-12-02 14:30:15,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-12-02 14:30:15,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:15,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 212 [2018-12-02 14:30:15,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,306 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 97 treesize of output 106 [2018-12-02 14:30:15,310 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 34 treesize of output 18 [2018-12-02 14:30:15,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,481 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 150 treesize of output 132 [2018-12-02 14:30:15,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 248 [2018-12-02 14:30:15,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:15,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 101 [2018-12-02 14:30:15,570 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 34 treesize of output 18 [2018-12-02 14:30:15,570 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,577 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:15,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:15,611 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:303, output treesize:191 [2018-12-02 14:30:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:15,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-12-02 14:30:15,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-12-02 14:30:16,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 117 states and 162 transitions. Complement of second has 22 states. [2018-12-02 14:30:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-12-02 14:30:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:30:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-12-02 14:30:16,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 11 letters. [2018-12-02 14:30:16,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:16,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 29 letters. Loop has 11 letters. [2018-12-02 14:30:16,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:16,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 22 letters. [2018-12-02 14:30:16,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:16,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 162 transitions. [2018-12-02 14:30:16,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-02 14:30:16,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 90 states and 121 transitions. [2018-12-02 14:30:16,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-12-02 14:30:16,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-12-02 14:30:16,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 121 transitions. [2018-12-02 14:30:16,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:16,314 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-12-02 14:30:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 121 transitions. [2018-12-02 14:30:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-12-02 14:30:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 14:30:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-12-02 14:30:16,320 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-12-02 14:30:16,320 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-12-02 14:30:16,320 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 14:30:16,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 98 transitions. [2018-12-02 14:30:16,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-02 14:30:16,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:16,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:16,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:16,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:30:16,323 INFO L794 eck$LassoCheckResult]: Stem: 2280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2277#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; 2254#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2255#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; 2263#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); 2278#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2279#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); 2275#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2276#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); 2289#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2288#L545-3 assume !(lis_~i~0 < lis_~N); 2282#L545-4 lis_~i~0 := 1; 2283#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2300#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; 2298#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; 2296#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 2261#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2262#L548-3 assume !(lis_~j~0 < lis_~i~0); 2295#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2272#L547-3 assume !(lis_~i~0 < lis_~N); 2273#L547-4 lis_~i~0 := 0; 2252#L551-3 [2018-12-02 14:30:16,323 INFO L796 eck$LassoCheckResult]: Loop: 2252#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); 2253#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; 2281#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 2252#L551-3 [2018-12-02 14:30:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2018-12-02 14:30:16,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:16,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:16,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:16,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:16,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:16,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-12-02 14:30:16,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:16,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2018-12-02 14:30:16,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 14:30:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:30:16,470 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. cyclomatic complexity: 31 Second operand 16 states. [2018-12-02 14:30:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:16,597 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2018-12-02 14:30:16,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:30:16,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 141 transitions. [2018-12-02 14:30:16,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-02 14:30:16,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 141 transitions. [2018-12-02 14:30:16,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-12-02 14:30:16,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-12-02 14:30:16,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 141 transitions. [2018-12-02 14:30:16,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:16,599 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 141 transitions. [2018-12-02 14:30:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 141 transitions. [2018-12-02 14:30:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2018-12-02 14:30:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 14:30:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2018-12-02 14:30:16,602 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-12-02 14:30:16,602 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-12-02 14:30:16,602 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 14:30:16,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2018-12-02 14:30:16,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-02 14:30:16,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:16,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:16,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:16,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:16,603 INFO L794 eck$LassoCheckResult]: Stem: 2551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2548#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; 2525#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2526#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; 2534#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); 2549#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2550#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); 2545#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2546#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); 2557#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2556#L545-3 assume !(lis_~i~0 < lis_~N); 2553#L545-4 lis_~i~0 := 1; 2554#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2573#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; 2571#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; 2568#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 2567#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2565#L548-3 assume !(lis_~j~0 < lis_~i~0); 2564#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2544#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2535#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; 2536#L549 assume !lis_#t~short11; 2527#L549-2 [2018-12-02 14:30:16,603 INFO L796 eck$LassoCheckResult]: Loop: 2527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2528#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2581#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; 2580#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; 2578#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 2575#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2576#L548-3 assume !(lis_~j~0 < lis_~i~0); 2558#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2559#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2594#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; 2593#L549 assume !lis_#t~short11; 2527#L549-2 [2018-12-02 14:30:16,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2018-12-02 14:30:16,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:16,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 1 times [2018-12-02 14:30:16,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:16,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:16,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:16,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:16,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 183297546, now seen corresponding path program 3 times [2018-12-02 14:30:16,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:16,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:30:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:16,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:16,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:30:16,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 14:30:16,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:16,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:30:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-02 14:30:17,036 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-12-02 14:30:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 14:30:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:30:17,100 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. cyclomatic complexity: 30 Second operand 20 states. [2018-12-02 14:30:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:17,355 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-12-02 14:30:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:30:17,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 187 transitions. [2018-12-02 14:30:17,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-12-02 14:30:17,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 186 transitions. [2018-12-02 14:30:17,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-12-02 14:30:17,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-02 14:30:17,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 186 transitions. [2018-12-02 14:30:17,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:17,357 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 186 transitions. [2018-12-02 14:30:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 186 transitions. [2018-12-02 14:30:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2018-12-02 14:30:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-02 14:30:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2018-12-02 14:30:17,360 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-12-02 14:30:17,360 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-12-02 14:30:17,360 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 14:30:17,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 167 transitions. [2018-12-02 14:30:17,360 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-02 14:30:17,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:17,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:17,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:17,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:17,361 INFO L794 eck$LassoCheckResult]: Stem: 2907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2904#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; 2882#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2883#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; 2891#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); 2905#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2906#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); 2902#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2903#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); 2932#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2928#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); 2929#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2931#L545-3 assume !(lis_~i~0 < lis_~N); 2930#L545-4 lis_~i~0 := 1; 2927#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2926#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; 2924#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; 2921#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 2920#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2918#L548-3 assume !(lis_~j~0 < lis_~i~0); 2915#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2916#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3003#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; 3002#L549 assume !lis_#t~short11; 2968#L549-2 [2018-12-02 14:30:17,361 INFO L796 eck$LassoCheckResult]: Loop: 2968#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2965#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2995#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; 2958#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; 2945#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 2946#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L548-3 assume !(lis_~j~0 < lis_~i~0); 2971#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2970#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2969#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; 2967#L549 assume !lis_#t~short11; 2968#L549-2 [2018-12-02 14:30:17,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 2 times [2018-12-02 14:30:17,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:17,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:17,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:17,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:17,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 2 times [2018-12-02 14:30:17,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:17,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:17,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:17,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:17,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1101378456, now seen corresponding path program 4 times [2018-12-02 14:30:17,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:17,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:18,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:18,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:30:18,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:30:18,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:18,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:18,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:18,747 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-12-02 14:30:18,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:18,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:18,766 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-12-02 14:30:18,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 14:30:18,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-12-02 14:30:18,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:18,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:18,907 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-12-02 14:30:18,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,920 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-12-02 14:30:18,922 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-12-02 14:30:18,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:18,938 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-12-02 14:30:18,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-12-02 14:30:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 14:30:19,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:19,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2018-12-02 14:30:19,418 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-12-02 14:30:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 14:30:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 14:30:19,473 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. cyclomatic complexity: 47 Second operand 33 states. [2018-12-02 14:30:21,299 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-02 14:30:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:24,834 INFO L93 Difference]: Finished difference Result 399 states and 518 transitions. [2018-12-02 14:30:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-02 14:30:24,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 518 transitions. [2018-12-02 14:30:24,835 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 96 [2018-12-02 14:30:24,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 394 states and 513 transitions. [2018-12-02 14:30:24,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2018-12-02 14:30:24,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2018-12-02 14:30:24,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 394 states and 513 transitions. [2018-12-02 14:30:24,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:24,837 INFO L705 BuchiCegarLoop]: Abstraction has 394 states and 513 transitions. [2018-12-02 14:30:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 513 transitions. [2018-12-02 14:30:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 228. [2018-12-02 14:30:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-02 14:30:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 306 transitions. [2018-12-02 14:30:24,842 INFO L728 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-12-02 14:30:24,842 INFO L608 BuchiCegarLoop]: Abstraction has 228 states and 306 transitions. [2018-12-02 14:30:24,842 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 14:30:24,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 306 transitions. [2018-12-02 14:30:24,843 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2018-12-02 14:30:24,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:24,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:24,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:24,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:30:24,843 INFO L794 eck$LassoCheckResult]: Stem: 3711#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3708#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; 3685#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3686#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; 3694#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); 3709#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3742#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); 3741#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3740#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); 3739#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3738#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); 3737#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3736#L545-3 assume !(lis_~i~0 < lis_~N); 3735#L545-4 lis_~i~0 := 1; 3734#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3732#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; 3729#L549 assume !lis_#t~short11; 3730#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3744#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3751#L548-3 assume !(lis_~j~0 < lis_~i~0); 3749#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3750#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3799#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; 3797#L549 assume !lis_#t~short11; 3798#L549-2 [2018-12-02 14:30:24,843 INFO L796 eck$LassoCheckResult]: Loop: 3798#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3885#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; 3824#L549 assume !lis_#t~short11; 3882#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3850#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3823#L548-3 assume !(lis_~j~0 < lis_~i~0); 3819#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3816#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3813#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; 3809#L549 assume !lis_#t~short11; 3798#L549-2 [2018-12-02 14:30:24,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash -896946752, now seen corresponding path program 1 times [2018-12-02 14:30:24,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:24,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2018-12-02 14:30:24,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:24,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:24,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 476161128, now seen corresponding path program 2 times [2018-12-02 14:30:24,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:27,047 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 243 DAG size of output: 181 [2018-12-02 14:30:27,566 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-02 14:30:27,569 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:27,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:27,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:27,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:27,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:27,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:27,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:27,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:27,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-12-02 14:30:27,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:27,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:27,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,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-12-02 14:30:27,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-12-02 14:30:27,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,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-12-02 14:30:27,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,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-12-02 14:30:27,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:27,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-12-02 14:30:27,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-12-02 14:30:28,424 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 117 [2018-12-02 14:30:28,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:28,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:28,877 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:28,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:28,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:28,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:28,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:28,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:28,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-12-02 14:30:28,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:28,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:28,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:28,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:28,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:28,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:28,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:28,961 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:30:28,961 INFO L444 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 14:30:28,962 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:28,962 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:30:28,962 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:28,962 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-12-02 14:30:29,128 INFO L297 tatePredicateManager]: 55 out of 56 supporting invariants were superfluous and have been removed [2018-12-02 14:30:29,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:29,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:29,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:29,197 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-02 14:30:29,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88 Second operand 9 states. [2018-12-02 14:30:29,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 228 states and 306 transitions. cyclomatic complexity: 88. Second operand 9 states. Result 558 states and 763 transitions. Complement of second has 15 states. [2018-12-02 14:30:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 5 non-accepting loop states 2 accepting loop states [2018-12-02 14:30:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 14:30:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2018-12-02 14:30:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 11 letters. [2018-12-02 14:30:29,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 35 letters. Loop has 11 letters. [2018-12-02 14:30:29,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 53 transitions. Stem has 24 letters. Loop has 22 letters. [2018-12-02 14:30:29,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:29,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 558 states and 763 transitions. [2018-12-02 14:30:29,286 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2018-12-02 14:30:29,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 558 states to 525 states and 714 transitions. [2018-12-02 14:30:29,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 363 [2018-12-02 14:30:29,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2018-12-02 14:30:29,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 714 transitions. [2018-12-02 14:30:29,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:29,290 INFO L705 BuchiCegarLoop]: Abstraction has 525 states and 714 transitions. [2018-12-02 14:30:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 714 transitions. [2018-12-02 14:30:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 439. [2018-12-02 14:30:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-02 14:30:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 604 transitions. [2018-12-02 14:30:29,299 INFO L728 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-12-02 14:30:29,299 INFO L608 BuchiCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-12-02 14:30:29,299 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 14:30:29,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 439 states and 604 transitions. [2018-12-02 14:30:29,301 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 77 [2018-12-02 14:30:29,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:29,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:29,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:29,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:30:29,302 INFO L794 eck$LassoCheckResult]: Stem: 4879#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4875#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; 4851#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4852#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; 4860#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); 4876#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4891#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); 4894#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4877#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); 4878#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4954#L545-3 assume !(lis_~i~0 < lis_~N); 4881#L545-4 lis_~i~0 := 1; 4882#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5043#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; 5041#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; 5038#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 5039#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5067#L548-3 assume !(lis_~j~0 < lis_~i~0); 5065#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5066#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5168#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; 5169#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; 5192#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 5172#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5255#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; 5072#L549 [2018-12-02 14:30:29,302 INFO L796 eck$LassoCheckResult]: Loop: 5072#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; 5254#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 5253#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5071#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; 5072#L549 [2018-12-02 14:30:29,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash -565876855, now seen corresponding path program 1 times [2018-12-02 14:30:29,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:29,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:29,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:29,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:29,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:29,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:29,654 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-12-02 14:30:29,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,659 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-12-02 14:30:29,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-12-02 14:30:29,684 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-12-02 14:30:29,686 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-12-02 14:30:29,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,692 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-12-02 14:30:29,694 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-12-02 14:30:29,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 14:30:29,751 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-12-02 14:30:29,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,754 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-12-02 14:30:29,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,765 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-12-02 14:30:29,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,768 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-12-02 14:30:29,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-12-02 14:30:29,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,886 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 103 treesize of output 93 [2018-12-02 14:30:29,889 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:29,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,896 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 56 treesize of output 91 [2018-12-02 14:30:29,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,916 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 67 treesize of output 74 [2018-12-02 14:30:29,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:29,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:29,921 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 58 [2018-12-02 14:30:29,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:29,947 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-12-02 14:30:29,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61 [2018-12-02 14:30:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:30,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-12-02 14:30:30,101 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:30,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 2 times [2018-12-02 14:30:30,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:30,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:30,230 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-02 14:30:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 14:30:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-02 14:30:30,323 INFO L87 Difference]: Start difference. First operand 439 states and 604 transitions. cyclomatic complexity: 183 Second operand 28 states. [2018-12-02 14:30:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:34,013 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions. [2018-12-02 14:30:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-02 14:30:34,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 900 transitions. [2018-12-02 14:30:34,015 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 160 [2018-12-02 14:30:34,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 655 states and 880 transitions. [2018-12-02 14:30:34,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2018-12-02 14:30:34,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2018-12-02 14:30:34,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 655 states and 880 transitions. [2018-12-02 14:30:34,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:34,018 INFO L705 BuchiCegarLoop]: Abstraction has 655 states and 880 transitions. [2018-12-02 14:30:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 880 transitions. [2018-12-02 14:30:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 367. [2018-12-02 14:30:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-02 14:30:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 494 transitions. [2018-12-02 14:30:34,023 INFO L728 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-12-02 14:30:34,023 INFO L608 BuchiCegarLoop]: Abstraction has 367 states and 494 transitions. [2018-12-02 14:30:34,023 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 14:30:34,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 494 transitions. [2018-12-02 14:30:34,023 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 61 [2018-12-02 14:30:34,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:34,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:34,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:34,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:34,024 INFO L794 eck$LassoCheckResult]: Stem: 6203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6199#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; 6174#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6175#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; 6183#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); 6200#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6212#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); 6213#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6201#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); 6202#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6211#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); 6196#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6197#L545-3 assume !(lis_~i~0 < lis_~N); 6228#L545-4 lis_~i~0 := 1; 6245#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6243#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; 6240#L549 assume !lis_#t~short11; 6222#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 6238#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6233#L548-3 assume !(lis_~j~0 < lis_~i~0); 6234#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6193#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6195#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; 6506#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; 6507#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 6177#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6500#L548-3 [2018-12-02 14:30:34,024 INFO L796 eck$LassoCheckResult]: Loop: 6500#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; 6531#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; 6455#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 6452#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6356#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; 6357#L549 assume !lis_#t~short11; 6295#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 6478#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6520#L548-3 assume !(lis_~j~0 < lis_~i~0); 6511#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6501#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6500#L548-3 [2018-12-02 14:30:34,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:34,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1322597504, now seen corresponding path program 1 times [2018-12-02 14:30:34,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:34,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:34,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:34,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:34,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:34,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:34,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:34,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:34,278 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-12-02 14:30:34,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,283 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-12-02 14:30:34,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-12-02 14:30:34,299 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-12-02 14:30:34,301 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-12-02 14:30:34,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,307 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-12-02 14:30:34,308 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-12-02 14:30:34,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 14:30:34,349 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-12-02 14:30:34,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,351 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-12-02 14:30:34,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,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, 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-12-02 14:30:34,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,364 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-12-02 14:30:34,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-12-02 14:30:34,419 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-12-02 14:30:34,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,423 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-12-02 14:30:34,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,438 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-12-02 14:30:34,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,444 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-12-02 14:30:34,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:79, output treesize:62 [2018-12-02 14:30:34,521 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-12-02 14:30:34,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,527 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-12-02 14:30:34,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,548 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-12-02 14:30:34,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:34,557 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-12-02 14:30:34,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:34,597 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-12-02 14:30:34,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:80 [2018-12-02 14:30:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:34,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-12-02 14:30:34,765 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash 237530077, now seen corresponding path program 3 times [2018-12-02 14:30:34,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:34,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:34,944 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-12-02 14:30:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 14:30:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-02 14:30:34,982 INFO L87 Difference]: Start difference. First operand 367 states and 494 transitions. cyclomatic complexity: 139 Second operand 25 states. [2018-12-02 14:30:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:37,703 INFO L93 Difference]: Finished difference Result 548 states and 718 transitions. [2018-12-02 14:30:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 14:30:37,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 718 transitions. [2018-12-02 14:30:37,705 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 123 [2018-12-02 14:30:37,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 718 transitions. [2018-12-02 14:30:37,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2018-12-02 14:30:37,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2018-12-02 14:30:37,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 718 transitions. [2018-12-02 14:30:37,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:37,708 INFO L705 BuchiCegarLoop]: Abstraction has 548 states and 718 transitions. [2018-12-02 14:30:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 718 transitions. [2018-12-02 14:30:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 331. [2018-12-02 14:30:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-02 14:30:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 438 transitions. [2018-12-02 14:30:37,713 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-12-02 14:30:37,713 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-12-02 14:30:37,713 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 14:30:37,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 438 transitions. [2018-12-02 14:30:37,714 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2018-12-02 14:30:37,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:37,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:37,715 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:37,715 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:30:37,715 INFO L794 eck$LassoCheckResult]: Stem: 7285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7281#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; 7256#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7257#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; 7265#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); 7282#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7297#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); 7298#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7283#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); 7284#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7292#L545-3 assume !(lis_~i~0 < lis_~N); 7287#L545-4 lis_~i~0 := 1; 7288#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7394#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; 7393#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; 7390#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 7388#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7389#L548-3 assume !(lis_~j~0 < lis_~i~0); 7384#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7273#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7274#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; 7510#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; 7511#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 7522#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7521#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; 7519#L549 assume !lis_#t~short11; 7520#L549-2 [2018-12-02 14:30:37,716 INFO L796 eck$LassoCheckResult]: Loop: 7520#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 7515#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7573#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; 7574#L549 assume !lis_#t~short11; 7520#L549-2 [2018-12-02 14:30:37,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash -362372859, now seen corresponding path program 3 times [2018-12-02 14:30:37,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:37,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:37,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 1 times [2018-12-02 14:30:37,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:37,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:37,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash 613161260, now seen corresponding path program 5 times [2018-12-02 14:30:37,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 14:30:37,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:37,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:37,821 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 14:30:37,903 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-02 14:30:37,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:37,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:30:37,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:37,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-12-02 14:30:38,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 14:30:38,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-02 14:30:38,018 INFO L87 Difference]: Start difference. First operand 331 states and 438 transitions. cyclomatic complexity: 120 Second operand 17 states. [2018-12-02 14:30:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:38,180 INFO L93 Difference]: Finished difference Result 418 states and 526 transitions. [2018-12-02 14:30:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 14:30:38,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 526 transitions. [2018-12-02 14:30:38,181 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 59 [2018-12-02 14:30:38,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 376 states and 481 transitions. [2018-12-02 14:30:38,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2018-12-02 14:30:38,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-12-02 14:30:38,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 481 transitions. [2018-12-02 14:30:38,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:38,183 INFO L705 BuchiCegarLoop]: Abstraction has 376 states and 481 transitions. [2018-12-02 14:30:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 481 transitions. [2018-12-02 14:30:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 287. [2018-12-02 14:30:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-02 14:30:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 374 transitions. [2018-12-02 14:30:38,188 INFO L728 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-12-02 14:30:38,188 INFO L608 BuchiCegarLoop]: Abstraction has 287 states and 374 transitions. [2018-12-02 14:30:38,188 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 14:30:38,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 374 transitions. [2018-12-02 14:30:38,189 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-12-02 14:30:38,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:38,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:38,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:38,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 14:30:38,190 INFO L794 eck$LassoCheckResult]: Stem: 8156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8154#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; 8131#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8132#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; 8140#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); 8151#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8152#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); 8155#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8177#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); 8178#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8196#L545-3 assume !(lis_~i~0 < lis_~N); 8158#L545-4 lis_~i~0 := 1; 8159#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8277#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; 8276#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; 8273#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 8271#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8272#L548-3 assume !(lis_~j~0 < lis_~i~0); 8267#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8148#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8149#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; 8412#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; 8307#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 8137#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8138#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; 8141#L549 assume !lis_#t~short11; 8161#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 8296#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8297#L548-3 assume !(lis_~j~0 < lis_~i~0); 8402#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8163#L547-3 assume !(lis_~i~0 < lis_~N); 8153#L547-4 lis_~i~0 := 0; 8129#L551-3 [2018-12-02 14:30:38,190 INFO L796 eck$LassoCheckResult]: Loop: 8129#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); 8130#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; 8157#L551-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 8129#L551-3 [2018-12-02 14:30:38,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash 837404217, now seen corresponding path program 1 times [2018-12-02 14:30:38,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:38,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:38,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 2 times [2018-12-02 14:30:38,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:38,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:38,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1939041103, now seen corresponding path program 1 times [2018-12-02 14:30:38,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:42,456 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 333 DAG size of output: 233 [2018-12-02 14:30:44,090 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 160 [2018-12-02 14:30:44,093 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:30:44,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:30:44,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:30:44,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:30:44,093 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:30:44,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:30:44,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:30:44,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:30:44,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration17_Lasso [2018-12-02 14:30:44,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:30:44,093 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:30:44,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-12-02 14:30:44,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:44,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:30:45,537 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 99 [2018-12-02 14:30:45,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-12-02 14:30:45,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-12-02 14:30:45,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:30:45,877 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:30:45,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:30:45,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:30:45,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:30:45,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,900 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:30:45,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:30:45,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:30:45,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:30:45,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:30:45,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:30:45,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:30:45,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:30:45,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:30:45,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:30:45,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:30:45,922 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:30:45,922 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 14:30:45,922 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:30:45,922 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:30:45,922 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:30:45,923 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-12-02 14:30:46,048 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 14:30:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:46,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:46,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:30:46,082 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-12-02 14:30:46,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96 Second operand 3 states. [2018-12-02 14:30:46,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 287 states and 374 transitions. cyclomatic complexity: 96. Second operand 3 states. Result 290 states and 379 transitions. Complement of second has 4 states. [2018-12-02 14:30:46,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 14:30:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:30:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-12-02 14:30:46,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2018-12-02 14:30:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2018-12-02 14:30:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2018-12-02 14:30:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:30:46,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 379 transitions. [2018-12-02 14:30:46,091 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-12-02 14:30:46,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 233 states and 294 transitions. [2018-12-02 14:30:46,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-12-02 14:30:46,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-12-02 14:30:46,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 294 transitions. [2018-12-02 14:30:46,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:46,092 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 294 transitions. [2018-12-02 14:30:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 294 transitions. [2018-12-02 14:30:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2018-12-02 14:30:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-02 14:30:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 259 transitions. [2018-12-02 14:30:46,093 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-12-02 14:30:46,093 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 259 transitions. [2018-12-02 14:30:46,093 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 14:30:46,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 259 transitions. [2018-12-02 14:30:46,094 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-12-02 14:30:46,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:46,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:46,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:46,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:30:46,094 INFO L794 eck$LassoCheckResult]: Stem: 9014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9011#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; 8991#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8992#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; 8999#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); 9012#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9013#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); 9009#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9010#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); 9026#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9025#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); 9023#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9024#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); 9021#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9020#L545-3 assume !(lis_~i~0 < lis_~N); 9022#L545-4 lis_~i~0 := 1; 9038#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9037#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; 9035#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; 9034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9033#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9032#L548-3 assume !(lis_~j~0 < lis_~i~0); 9027#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9084#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; 9081#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; 9082#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9117#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9116#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; 9113#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; 9107#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 9106#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9097#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-12-02 14:30:46,094 INFO L796 eck$LassoCheckResult]: Loop: 9096#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9095#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9094#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; 9092#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; 9093#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9102#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9105#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; 9103#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; 9100#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9098#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9099#L548-3 assume !(lis_~j~0 < lis_~i~0); 9096#L547-2 [2018-12-02 14:30:46,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1848019324, now seen corresponding path program 2 times [2018-12-02 14:30:46,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:46,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:46,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:30:46,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:46,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:30:46,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:30:46,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:46,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:46,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 14:30:46,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,593 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-12-02 14:30:46,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-12-02 14:30:46,634 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-12-02 14:30:46,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,637 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-12-02 14:30:46,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,647 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-12-02 14:30:46,649 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-12-02 14:30:46,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-12-02 14:30:46,725 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-12-02 14:30:46,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:46,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,734 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:46,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, 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-12-02 14:30:46,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,753 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-12-02 14:30:46,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:46,756 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-12-02 14:30:46,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:46,776 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-12-02 14:30:46,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:74 [2018-12-02 14:30:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 14:30:46,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:46,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2018-12-02 14:30:46,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:30:46,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 7 times [2018-12-02 14:30:46,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:46,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:47,163 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-12-02 14:30:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 14:30:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-12-02 14:30:47,232 INFO L87 Difference]: Start difference. First operand 206 states and 259 transitions. cyclomatic complexity: 61 Second operand 27 states. [2018-12-02 14:30:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:49,600 INFO L93 Difference]: Finished difference Result 417 states and 528 transitions. [2018-12-02 14:30:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-02 14:30:49,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 528 transitions. [2018-12-02 14:30:49,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 103 [2018-12-02 14:30:49,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 413 states and 524 transitions. [2018-12-02 14:30:49,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2018-12-02 14:30:49,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2018-12-02 14:30:49,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 524 transitions. [2018-12-02 14:30:49,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:49,602 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 524 transitions. [2018-12-02 14:30:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 524 transitions. [2018-12-02 14:30:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 311. [2018-12-02 14:30:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-02 14:30:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 403 transitions. [2018-12-02 14:30:49,605 INFO L728 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-12-02 14:30:49,605 INFO L608 BuchiCegarLoop]: Abstraction has 311 states and 403 transitions. [2018-12-02 14:30:49,605 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 14:30:49,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 403 transitions. [2018-12-02 14:30:49,606 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 82 [2018-12-02 14:30:49,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:49,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:49,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:49,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:30:49,607 INFO L794 eck$LassoCheckResult]: Stem: 9842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9839#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; 9816#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9817#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; 9825#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); 9840#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9841#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); 9837#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9838#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); 9853#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9852#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); 9850#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9851#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); 9848#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9847#L545-3 assume !(lis_~i~0 < lis_~N); 9849#L545-4 lis_~i~0 := 1; 9863#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9862#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; 9860#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; 9859#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9858#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9857#L548-3 assume !(lis_~j~0 < lis_~i~0); 9854#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9856#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9971#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; 9969#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; 9970#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10064#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10063#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; 10062#L549 assume !lis_#t~short11; 10061#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 10060#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10014#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-12-02 14:30:49,607 INFO L796 eck$LassoCheckResult]: Loop: 10015#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10007#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10008#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; 10003#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; 10000#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10001#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9996#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; 9997#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; 9990#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 9991#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10057#L548-3 assume !(lis_~j~0 < lis_~i~0); 10015#L547-2 [2018-12-02 14:30:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1848078906, now seen corresponding path program 6 times [2018-12-02 14:30:49,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 8 times [2018-12-02 14:30:49,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash -339256426, now seen corresponding path program 7 times [2018-12-02 14:30:49,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:49,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:30:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 14:30:49,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:49,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:49,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:49,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 14:30:49,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:30:49,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-12-02 14:30:50,094 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-12-02 14:30:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 14:30:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-02 14:30:50,177 INFO L87 Difference]: Start difference. First operand 311 states and 403 transitions. cyclomatic complexity: 102 Second operand 17 states. [2018-12-02 14:30:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:30:50,329 INFO L93 Difference]: Finished difference Result 359 states and 456 transitions. [2018-12-02 14:30:50,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:30:50,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 456 transitions. [2018-12-02 14:30:50,331 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 127 [2018-12-02 14:30:50,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 309 states and 394 transitions. [2018-12-02 14:30:50,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-12-02 14:30:50,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2018-12-02 14:30:50,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 394 transitions. [2018-12-02 14:30:50,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:30:50,332 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 394 transitions. [2018-12-02 14:30:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 394 transitions. [2018-12-02 14:30:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 183. [2018-12-02 14:30:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-02 14:30:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2018-12-02 14:30:50,335 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-12-02 14:30:50,335 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 223 transitions. [2018-12-02 14:30:50,335 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 14:30:50,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 223 transitions. [2018-12-02 14:30:50,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 66 [2018-12-02 14:30:50,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:30:50,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:30:50,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:30:50,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-12-02 14:30:50,337 INFO L794 eck$LassoCheckResult]: Stem: 10673#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10670#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; 10657#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10658#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; 10662#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); 10671#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10672#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); 10668#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10669#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); 10683#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10682#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); 10680#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10681#L545-3 assume !(lis_~i~0 < lis_~N); 10674#L545-4 lis_~i~0 := 1; 10675#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10715#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; 10716#L549 assume !lis_#t~short11; 10710#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 10709#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10708#L548-3 assume !(lis_~j~0 < lis_~i~0); 10707#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10706#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10705#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; 10703#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; 10704#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10750#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10748#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; 10743#L549 assume !lis_#t~short11; 10744#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 10802#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10684#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-12-02 14:30:50,337 INFO L796 eck$LassoCheckResult]: Loop: 10664#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10665#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10800#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; 10799#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; 10797#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10796#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10795#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; 10792#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; 10790#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10789#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10788#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; 10736#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; 10786#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 10772#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10735#L548-3 assume !(lis_~j~0 < lis_~i~0); 10664#L547-2 [2018-12-02 14:30:50,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2081786852, now seen corresponding path program 8 times [2018-12-02 14:30:50,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:50,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:30:50,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:30:50,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:30:50,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:30:50,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:30:50,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:30:50,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:50,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,767 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-12-02 14:30:50,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,777 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-12-02 14:30:50,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-02 14:30:50,801 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 39 treesize of output 28 [2018-12-02 14:30:50,803 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-12-02 14:30:50,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,809 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 27 treesize of output 41 [2018-12-02 14:30:50,811 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-12-02 14:30:50,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:43 [2018-12-02 14:30:50,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-12-02 14:30:50,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,878 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 37 treesize of output 58 [2018-12-02 14:30:50,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:50,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-12-02 14:30:50,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,906 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 37 treesize of output 66 [2018-12-02 14:30:50,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:50,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:50,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:74, output treesize:57 [2018-12-02 14:30:50,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 79 [2018-12-02 14:30:50,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:50,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,002 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 3 case distinctions, treesize of input 44 treesize of output 89 [2018-12-02 14:30:51,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:51,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-12-02 14:30:51,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,043 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-12-02 14:30:51,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:51,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:92, output treesize:75 [2018-12-02 14:30:51,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2018-12-02 14:30:51,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,181 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 112 [2018-12-02 14:30:51,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:51,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 85 [2018-12-02 14:30:51,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:51,234 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 184 [2018-12-02 14:30:51,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:30:51,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:30:51,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:86 [2018-12-02 14:30:52,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 175 [2018-12-02 14:30:52,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:52,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,298 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:52,346 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-12-02 14:30:52,388 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 80 treesize of output 169 [2018-12-02 14:30:52,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-12-02 14:30:52,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 185 [2018-12-02 14:30:52,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,632 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:52,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,656 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-12-02 14:30:52,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:52,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:52,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 186 [2018-12-02 14:30:52,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,785 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:52,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,821 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 183 [2018-12-02 14:30:52,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:52,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:52,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 195 [2018-12-02 14:30:52,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,965 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:52,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:52,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,009 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 209 [2018-12-02 14:30:53,010 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 202 [2018-12-02 14:30:53,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,166 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:53,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,208 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-12-02 14:30:53,210 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,359 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 169 [2018-12-02 14:30:53,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:53,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,403 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 179 [2018-12-02 14:30:53,404 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,495 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 196 [2018-12-02 14:30:53,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:53,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,558 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 205 [2018-12-02 14:30:53,559 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,688 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 203 [2018-12-02 14:30:53,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:30:53,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:30:53,758 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 217 [2018-12-02 14:30:53,760 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:53,886 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:30:55,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 65 dim-0 vars, and 21 xjuncts. [2018-12-02 14:30:56,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 107 dim-0 vars, and 21 xjuncts. [2018-12-02 14:30:56,068 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:149, output treesize:3653 [2018-12-02 14:31:03,416 WARN L180 SmtUtils]: Spent 7.06 s on a formula simplification. DAG size of input: 975 DAG size of output: 67 [2018-12-02 14:31:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:31:03,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:31:03,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2018-12-02 14:31:03,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:31:03,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:31:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash -304943832, now seen corresponding path program 9 times [2018-12-02 14:31:03,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:31:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:31:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:03,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:31:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:04,426 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-12-02 14:31:04,626 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-02 14:31:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 14:31:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 14:31:04,627 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. cyclomatic complexity: 45 Second operand 37 states. [2018-12-02 14:31:07,858 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-02 14:31:11,153 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-02 14:31:11,473 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-12-02 14:31:11,824 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-12-02 14:31:12,044 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-12-02 14:31:12,388 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-12-02 14:31:12,658 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-12-02 14:31:12,960 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-12-02 14:31:13,165 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-02 14:31:13,445 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2018-12-02 14:31:13,688 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-12-02 14:31:13,916 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2018-12-02 14:31:14,213 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-12-02 14:31:14,453 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-02 14:31:14,717 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-12-02 14:31:14,999 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-12-02 14:31:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:31:15,012 INFO L93 Difference]: Finished difference Result 408 states and 524 transitions. [2018-12-02 14:31:15,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-02 14:31:15,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 524 transitions. [2018-12-02 14:31:15,014 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 234 [2018-12-02 14:31:15,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 524 transitions. [2018-12-02 14:31:15,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 395 [2018-12-02 14:31:15,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2018-12-02 14:31:15,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 524 transitions. [2018-12-02 14:31:15,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:31:15,017 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 524 transitions. [2018-12-02 14:31:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 524 transitions. [2018-12-02 14:31:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 204. [2018-12-02 14:31:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-02 14:31:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 247 transitions. [2018-12-02 14:31:15,022 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-12-02 14:31:15,022 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 247 transitions. [2018-12-02 14:31:15,022 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 14:31:15,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 247 transitions. [2018-12-02 14:31:15,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 70 [2018-12-02 14:31:15,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:31:15,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:31:15,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:31:15,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 14:31:15,023 INFO L794 eck$LassoCheckResult]: Stem: 11577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11573#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; 11560#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11561#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; 11565#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); 11574#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11584#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); 11582#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11583#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); 11585#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11575#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); 11576#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11711#L545-3 assume !(lis_~i~0 < lis_~N); 11578#L545-4 lis_~i~0 := 1; 11579#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11597#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; 11598#L549 assume !lis_#t~short11; 11631#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 11630#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11629#L548-3 assume !(lis_~j~0 < lis_~i~0); 11628#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11627#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11626#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; 11624#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; 11625#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 11661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11660#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; 11657#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; 11591#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 11590#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11586#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-12-02 14:31:15,024 INFO L796 eck$LassoCheckResult]: Loop: 11567#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11568#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11745#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; 11744#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; 11742#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 11741#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11740#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; 11728#L549 assume !lis_#t~short11; 11687#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 11686#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11723#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; 11680#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; 11721#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 11682#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11679#L548-3 assume !(lis_~j~0 < lis_~i~0); 11567#L547-2 [2018-12-02 14:31:15,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:31:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2081846434, now seen corresponding path program 9 times [2018-12-02 14:31:15,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:31:15,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:31:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:31:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:15,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:31:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 660716904, now seen corresponding path program 4 times [2018-12-02 14:31:15,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:31:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:31:15,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:31:15,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:31:15,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:31:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1506700395, now seen corresponding path program 10 times [2018-12-02 14:31:15,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:31:15,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:31:15,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:31:15,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:31:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:31:15,624 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2018-12-02 14:31:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:31:16,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:31:16,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:31:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:31:17,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:31:17,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:31:17,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:31:17,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,047 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-12-02 14:31:17,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,057 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-12-02 14:31:17,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 14:31:17,196 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 73 treesize of output 53 [2018-12-02 14:31:17,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,204 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-12-02 14:31:17,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:31:17,218 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-12-02 14:31:17,220 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-12-02 14:31:17,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,230 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 40 treesize of output 41 [2018-12-02 14:31:17,232 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-12-02 14:31:17,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:31:17,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 14:31:17,262 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:85, output treesize:93 [2018-12-02 14:31:17,622 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-02 14:31:17,734 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 110 [2018-12-02 14:31:17,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,762 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 46 treesize of output 147 [2018-12-02 14:31:17,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-02 14:31:17,812 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 102 treesize of output 109 [2018-12-02 14:31:17,814 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:31:17,815 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-12-02 14:31:17,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,836 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 100 treesize of output 107 [2018-12-02 14:31:17,845 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 56 [2018-12-02 14:31:17,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:31:17,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,870 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 115 [2018-12-02 14:31:17,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:17,874 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 48 treesize of output 75 [2018-12-02 14:31:17,874 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,889 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:31:17,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:31:18,001 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 120 treesize of output 100 [2018-12-02 14:31:18,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:18,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:31:18,005 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 56 [2018-12-02 14:31:18,005 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:31:18,028 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-12-02 14:31:18,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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-12-02 14:31:18,035 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 14:31:18,050 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:31:18,073 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:31:18,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 4 xjuncts. [2018-12-02 14:31:18,144 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:259, output treesize:388 [2018-12-02 14:31:18,632 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 46 [2018-12-02 14:31:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 58 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 14:31:18,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:31:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-12-02 14:31:19,114 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 126 [2018-12-02 14:31:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 14:31:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 14:31:19,191 INFO L87 Difference]: Start difference. First operand 204 states and 247 transitions. cyclomatic complexity: 49 Second operand 34 states. [2018-12-02 14:31:31,329 WARN L180 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-12-02 14:31:43,532 WARN L180 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-12-02 14:32:08,314 WARN L180 SmtUtils]: Spent 24.74 s on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2018-12-02 14:32:20,650 WARN L180 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-02 14:32:21,980 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-12-02 14:32:22,172 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2018-12-02 14:32:23,151 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-12-02 14:32:23,388 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-12-02 14:32:23,653 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2018-12-02 14:32:23,958 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-02 14:32:24,165 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2018-12-02 14:32:24,521 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2018-12-02 14:32:24,746 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-12-02 14:32:24,952 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2018-12-02 14:32:25,450 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2018-12-02 14:32:25,624 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2018-12-02 14:32:25,843 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2018-12-02 14:32:26,201 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-12-02 14:32:26,622 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-12-02 14:32:26,828 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2018-12-02 14:32:27,036 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-12-02 14:32:27,390 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 101 [2018-12-02 14:32:27,630 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2018-12-02 14:32:27,985 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2018-12-02 14:32:28,297 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 97 [2018-12-02 14:32:28,958 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2018-12-02 14:32:29,449 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2018-12-02 14:32:29,847 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 89 [2018-12-02 14:32:30,125 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-12-02 14:32:30,472 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2018-12-02 14:32:30,728 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2018-12-02 14:32:30,986 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2018-12-02 14:32:31,246 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 117 [2018-12-02 14:32:31,620 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2018-12-02 14:32:32,073 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2018-12-02 14:32:32,362 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 118 [2018-12-02 14:32:32,775 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2018-12-02 14:32:33,184 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-12-02 14:32:33,719 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2018-12-02 14:32:34,147 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2018-12-02 14:32:34,580 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-12-02 14:32:39,115 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2018-12-02 14:32:39,377 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-12-02 14:32:39,618 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-12-02 14:32:39,916 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2018-12-02 14:32:40,289 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 103 [2018-12-02 14:32:40,532 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-12-02 14:32:40,769 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2018-12-02 14:32:41,099 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2018-12-02 14:32:41,498 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 100 [2018-12-02 14:32:41,896 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2018-12-02 14:32:42,234 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2018-12-02 14:32:42,572 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-12-02 14:32:42,815 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2018-12-02 14:32:43,195 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2018-12-02 14:32:44,137 WARN L180 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2018-12-02 14:32:44,728 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-12-02 14:32:45,057 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2018-12-02 14:32:45,299 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-12-02 14:32:45,488 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-12-02 14:32:45,822 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-12-02 14:32:46,137 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-12-02 14:32:46,345 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2018-12-02 14:32:46,622 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 100 [2018-12-02 14:32:46,899 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 93 [2018-12-02 14:32:47,168 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2018-12-02 14:32:47,410 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2018-12-02 14:32:47,590 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2018-12-02 14:32:47,811 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2018-12-02 14:32:48,027 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2018-12-02 14:32:48,764 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2018-12-02 14:32:49,207 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2018-12-02 14:32:49,538 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2018-12-02 14:32:49,823 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2018-12-02 14:32:50,099 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2018-12-02 14:32:50,350 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-02 14:32:50,571 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-12-02 14:32:50,801 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 81 [2018-12-02 14:32:51,059 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2018-12-02 14:32:51,339 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2018-12-02 14:32:52,099 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 88 [2018-12-02 14:32:52,411 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2018-12-02 14:32:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:32:52,423 INFO L93 Difference]: Finished difference Result 421 states and 523 transitions. [2018-12-02 14:32:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-02 14:32:52,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 523 transitions. [2018-12-02 14:32:52,425 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 204 [2018-12-02 14:32:52,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 421 states and 523 transitions. [2018-12-02 14:32:52,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2018-12-02 14:32:52,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2018-12-02 14:32:52,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 523 transitions. [2018-12-02 14:32:52,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:32:52,426 INFO L705 BuchiCegarLoop]: Abstraction has 421 states and 523 transitions. [2018-12-02 14:32:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 523 transitions. [2018-12-02 14:32:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 360. [2018-12-02 14:32:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 14:32:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 445 transitions. [2018-12-02 14:32:52,429 INFO L728 BuchiCegarLoop]: Abstraction has 360 states and 445 transitions. [2018-12-02 14:32:52,429 INFO L608 BuchiCegarLoop]: Abstraction has 360 states and 445 transitions. [2018-12-02 14:32:52,429 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 14:32:52,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 360 states and 445 transitions. [2018-12-02 14:32:52,430 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 171 [2018-12-02 14:32:52,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:32:52,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:32:52,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:32:52,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-12-02 14:32:52,430 INFO L794 eck$LassoCheckResult]: Stem: 12606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12602#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; 12589#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12590#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; 12594#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); 12603#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12613#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); 12600#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12601#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); 12614#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12604#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); 12605#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12609#L545-3 assume !(lis_~i~0 < lis_~N); 12611#L545-4 lis_~i~0 := 1; 12687#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12688#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; 12682#L549 assume !lis_#t~short11; 12684#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 12678#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12679#L548-3 assume !(lis_~j~0 < lis_~i~0); 12674#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12675#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12670#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; 12671#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; 12755#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 12754#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 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;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12751#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 12749#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12748#L548-3 assume !(lis_~j~0 < lis_~i~0); 12743#L547-2 [2018-12-02 14:32:52,430 INFO L796 eck$LassoCheckResult]: Loop: 12743#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12742#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12741#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; 12739#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; 12740#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 12729#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12730#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; 12725#L549 assume !lis_#t~short11; 12723#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 12724#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12719#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; 12720#L549 assume !lis_#t~short11; 12760#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 12757#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12746#L548-3 assume !(lis_~j~0 < lis_~i~0); 12743#L547-2 [2018-12-02 14:32:52,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:32:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2081846434, now seen corresponding path program 11 times [2018-12-02 14:32:52,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:32:52,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:32:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:32:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:32:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:32:52,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:32:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1361842986, now seen corresponding path program 1 times [2018-12-02 14:32:52,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:32:52,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:32:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:32:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:32:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:32:52,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:32:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2087140819, now seen corresponding path program 12 times [2018-12-02 14:32:52,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:32:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:32:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:32:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:32:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:32:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:32:53,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:32:53,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:32:53,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 14:32:53,434 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-02 14:32:53,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:32:53,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:32:53,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,444 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-12-02 14:32:53,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,454 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-12-02 14:32:53,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-02 14:32:53,482 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-12-02 14:32:53,483 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-12-02 14:32:53,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,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, 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-12-02 14:32:53,491 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-12-02 14:32:53,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-12-02 14:32:53,549 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-12-02 14:32:53,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,552 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-12-02 14:32:53,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,562 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-12-02 14:32:53,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,565 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-12-02 14:32:53,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-12-02 14:32:53,640 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-12-02 14:32:53,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,644 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-12-02 14:32:53,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,658 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-12-02 14:32:53,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,664 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-12-02 14:32:53,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-12-02 14:32:53,792 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-12-02 14:32:53,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,810 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-12-02 14:32:53,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,865 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-12-02 14:32:53,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:53,886 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-12-02 14:32:53,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:53,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:100, output treesize:83 [2018-12-02 14:32:54,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,733 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 120 treesize of output 110 [2018-12-02 14:32:54,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,741 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:32:54,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,752 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 110 [2018-12-02 14:32:54,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:54,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,819 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 92 treesize of output 95 [2018-12-02 14:32:54,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,836 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:32:54,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:32:54,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 172 [2018-12-02 14:32:54,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:32:54,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:54,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:32:54,947 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-12-02 14:32:54,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:89 [2018-12-02 14:32:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 43 proven. 47 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 14:32:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:32:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-12-02 14:32:55,398 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-12-02 14:32:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 14:32:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 14:32:55,421 INFO L87 Difference]: Start difference. First operand 360 states and 445 transitions. cyclomatic complexity: 97 Second operand 39 states. [2018-12-02 14:32:56,868 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2018-12-02 14:32:57,431 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2018-12-02 14:32:57,770 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 49 [2018-12-02 14:32:58,277 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 50 [2018-12-02 14:33:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:04,418 INFO L93 Difference]: Finished difference Result 647 states and 799 transitions. [2018-12-02 14:33:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-02 14:33:04,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 647 states and 799 transitions. [2018-12-02 14:33:04,421 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 220 [2018-12-02 14:33:04,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 647 states to 594 states and 739 transitions. [2018-12-02 14:33:04,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2018-12-02 14:33:04,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2018-12-02 14:33:04,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 739 transitions. [2018-12-02 14:33:04,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:33:04,425 INFO L705 BuchiCegarLoop]: Abstraction has 594 states and 739 transitions. [2018-12-02 14:33:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 739 transitions. [2018-12-02 14:33:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 465. [2018-12-02 14:33:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-12-02 14:33:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 579 transitions. [2018-12-02 14:33:04,432 INFO L728 BuchiCegarLoop]: Abstraction has 465 states and 579 transitions. [2018-12-02 14:33:04,432 INFO L608 BuchiCegarLoop]: Abstraction has 465 states and 579 transitions. [2018-12-02 14:33:04,433 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 14:33:04,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 579 transitions. [2018-12-02 14:33:04,434 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 187 [2018-12-02 14:33:04,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:33:04,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:33:04,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:04,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-12-02 14:33:04,435 INFO L794 eck$LassoCheckResult]: Stem: 13934#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13930#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; 13917#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13918#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; 13922#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); 13931#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13942#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); 13928#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13929#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); 13943#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13932#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); 13933#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13941#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); 13939#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13938#L545-3 assume !(lis_~i~0 < lis_~N); 13940#L545-4 lis_~i~0 := 1; 14016#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14017#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; 14012#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; 14013#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 14033#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14034#L548-3 assume !(lis_~j~0 < lis_~i~0); 14028#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14101#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; 14099#L549 assume !lis_#t~short11; 14100#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 14194#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14193#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; 14192#L549 assume !lis_#t~short11; 14191#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 14190#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14189#L548-3 assume !(lis_~j~0 < lis_~i~0); 14186#L547-2 [2018-12-02 14:33:04,435 INFO L796 eck$LassoCheckResult]: Loop: 14186#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14185#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14184#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; 14182#L549 assume !lis_#t~short11; 14180#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 14181#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14163#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; 14164#L549 assume !lis_#t~short11; 14203#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 14200#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14199#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; 14188#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; 14196#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 14195#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14187#L548-3 assume !(lis_~j~0 < lis_~i~0); 14186#L547-2 [2018-12-02 14:33:04,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1481227654, now seen corresponding path program 13 times [2018-12-02 14:33:04,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:04,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:04,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1619948842, now seen corresponding path program 2 times [2018-12-02 14:33:04,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:04,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash -818032239, now seen corresponding path program 14 times [2018-12-02 14:33:04,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 103 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 14:33:05,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:33:05,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:33:05,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:33:05,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:33:05,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:33:05,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:05,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,341 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-12-02 14:33:05,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,354 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-12-02 14:33:05,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-02 14:33:05,421 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-12-02 14:33:05,423 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-12-02 14:33:05,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,432 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-12-02 14:33:05,433 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-12-02 14:33:05,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-12-02 14:33:05,508 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-12-02 14:33:05,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,511 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-12-02 14:33:05,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,524 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-12-02 14:33:05,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,527 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-12-02 14:33:05,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-12-02 14:33:05,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2018-12-02 14:33:05,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,632 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 27 treesize of output 58 [2018-12-02 14:33:05,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-12-02 14:33:05,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,658 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 27 treesize of output 94 [2018-12-02 14:33:05,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:33:05,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-12-02 14:33:05,791 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 118 treesize of output 92 [2018-12-02 14:33:05,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,819 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 132 [2018-12-02 14:33:05,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:33:05,867 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 85 treesize of output 80 [2018-12-02 14:33:05,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,879 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 36 treesize of output 185 [2018-12-02 14:33:05,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,910 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 95 treesize of output 90 [2018-12-02 14:33:05,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:05,922 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 36 treesize of output 153 [2018-12-02 14:33:05,923 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,945 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:05,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:33:06,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 14:33:06,007 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:131, output treesize:189 [2018-12-02 14:33:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 13 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 14:33:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:33:07,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-12-02 14:33:07,474 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-12-02 14:33:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 14:33:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 14:33:07,497 INFO L87 Difference]: Start difference. First operand 465 states and 579 transitions. cyclomatic complexity: 130 Second operand 37 states. [2018-12-02 14:33:09,287 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2018-12-02 14:33:09,601 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-12-02 14:33:10,302 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-12-02 14:33:10,512 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2018-12-02 14:33:10,914 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 94 [2018-12-02 14:33:11,102 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2018-12-02 14:33:11,836 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 115 [2018-12-02 14:33:12,897 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2018-12-02 14:33:13,111 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2018-12-02 14:33:13,679 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2018-12-02 14:33:14,343 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-12-02 14:33:14,951 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 96 [2018-12-02 14:33:15,773 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-12-02 14:33:16,368 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-12-02 14:33:16,869 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2018-12-02 14:33:17,855 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-12-02 14:33:27,698 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-12-02 14:33:27,968 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-12-02 14:33:28,262 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-12-02 14:33:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:33,354 INFO L93 Difference]: Finished difference Result 1153 states and 1489 transitions. [2018-12-02 14:33:33,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-12-02 14:33:33,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1153 states and 1489 transitions. [2018-12-02 14:33:33,357 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 412 [2018-12-02 14:33:33,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1153 states to 1153 states and 1489 transitions. [2018-12-02 14:33:33,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1143 [2018-12-02 14:33:33,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1143 [2018-12-02 14:33:33,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1153 states and 1489 transitions. [2018-12-02 14:33:33,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:33:33,360 INFO L705 BuchiCegarLoop]: Abstraction has 1153 states and 1489 transitions. [2018-12-02 14:33:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states and 1489 transitions. [2018-12-02 14:33:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 982. [2018-12-02 14:33:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-12-02 14:33:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1286 transitions. [2018-12-02 14:33:33,370 INFO L728 BuchiCegarLoop]: Abstraction has 982 states and 1286 transitions. [2018-12-02 14:33:33,370 INFO L608 BuchiCegarLoop]: Abstraction has 982 states and 1286 transitions. [2018-12-02 14:33:33,370 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-02 14:33:33,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 982 states and 1286 transitions. [2018-12-02 14:33:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 339 [2018-12-02 14:33:33,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:33:33,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:33:33,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:33,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:33:33,372 INFO L794 eck$LassoCheckResult]: Stem: 15994#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15991#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; 15978#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15979#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; 15983#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); 15992#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15993#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); 15989#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15990#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); 16004#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16003#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); 16001#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 16002#L545-3 assume !(lis_~i~0 < lis_~N); 15995#L545-4 lis_~i~0 := 1; 15996#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16136#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; 16134#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; 16135#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 16152#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16151#L548-3 assume !(lis_~j~0 < lis_~i~0); 16149#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 16150#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16677#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; 16676#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; 16673#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 16671#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16672#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; 16660#L549 assume !lis_#t~short11; 16661#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 16596#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 16597#L548-3 assume !(lis_~j~0 < lis_~i~0); 15985#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15986#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 16957#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; 16935#L549 assume !lis_#t~short11; 15980#L549-2 [2018-12-02 14:33:33,372 INFO L796 eck$LassoCheckResult]: Loop: 15980#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 15981#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15982#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; 15984#L549 assume !lis_#t~short11; 15980#L549-2 [2018-12-02 14:33:33,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947736, now seen corresponding path program 15 times [2018-12-02 14:33:33,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:33,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 2 times [2018-12-02 14:33:33,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:33,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -126387441, now seen corresponding path program 16 times [2018-12-02 14:33:33,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:41,212 WARN L180 SmtUtils]: Spent 7.73 s on a formula simplification. DAG size of input: 377 DAG size of output: 259 [2018-12-02 14:33:42,801 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 174 [2018-12-02 14:33:42,803 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:33:42,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:33:42,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:33:42,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:33:42,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:33:42,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:33:42,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:33:42,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:33:42,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration24_Lasso [2018-12-02 14:33:42,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:33:42,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:33:42,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:42,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:44,886 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 126 [2018-12-02 14:33:44,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:44,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:44,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:44,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:44,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-12-02 14:33:44,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:33:45,178 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2018-12-02 14:33:45,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:33:45,369 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:33:45,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,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-12-02 14:33:45,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:33:45,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:33:45,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:33:45,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,386 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:33:45,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:33:45,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:33:45,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,391 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:33:45,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,398 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 14:33:45,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,398 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:33:45,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:33:45,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:33:45,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:33:45,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:33:45,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:33:45,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:33:45,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:33:45,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:33:45,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:33:45,425 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:33:45,426 INFO L444 ModelExtractionUtils]: 49 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 14:33:45,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:33:45,426 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:33:45,426 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:33:45,426 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-12-02 14:33:45,789 INFO L297 tatePredicateManager]: 79 out of 79 supporting invariants were superfluous and have been removed [2018-12-02 14:33:45,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:45,825 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-12-02 14:33:45,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-12-02 14:33:45,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1262 states and 1656 transitions. Complement of second has 7 states. [2018-12-02 14:33:45,845 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-12-02 14:33:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 14:33:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 14:33:45,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 35 letters. Loop has 4 letters. [2018-12-02 14:33:45,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:33:45,845 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:33:45,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:45,885 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 14:33:45,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-12-02 14:33:45,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1275 states and 1671 transitions. Complement of second has 9 states. [2018-12-02 14:33:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 14:33:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 14:33:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-12-02 14:33:45,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 35 letters. Loop has 4 letters. [2018-12-02 14:33:45,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:33:45,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:33:45,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:45,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:45,955 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 14:33:45,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340 Second operand 5 states. [2018-12-02 14:33:45,980 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 982 states and 1286 transitions. cyclomatic complexity: 340. Second operand 5 states. Result 1952 states and 2630 transitions. Complement of second has 8 states. [2018-12-02 14:33:45,980 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-12-02 14:33:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 14:33:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-12-02 14:33:45,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 35 letters. Loop has 4 letters. [2018-12-02 14:33:45,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:33:45,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 39 letters. Loop has 4 letters. [2018-12-02 14:33:45,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:33:45,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2018-12-02 14:33:45,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:33:45,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1952 states and 2630 transitions. [2018-12-02 14:33:45,988 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 458 [2018-12-02 14:33:45,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1952 states to 1503 states and 2058 transitions. [2018-12-02 14:33:45,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 867 [2018-12-02 14:33:45,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1021 [2018-12-02 14:33:45,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1503 states and 2058 transitions. [2018-12-02 14:33:45,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:33:45,995 INFO L705 BuchiCegarLoop]: Abstraction has 1503 states and 2058 transitions. [2018-12-02 14:33:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states and 2058 transitions. [2018-12-02 14:33:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1254. [2018-12-02 14:33:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-12-02 14:33:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-12-02 14:33:46,012 INFO L728 BuchiCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-12-02 14:33:46,012 INFO L608 BuchiCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-12-02 14:33:46,012 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-02 14:33:46,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1254 states and 1776 transitions. [2018-12-02 14:33:46,016 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 405 [2018-12-02 14:33:46,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:33:46,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:33:46,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:46,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:33:46,016 INFO L794 eck$LassoCheckResult]: Stem: 22185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 22182#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; 22165#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 22166#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; 22174#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); 22183#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22184#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); 22180#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22181#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); 22198#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22197#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); 22195#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22196#L545-3 assume !(lis_~i~0 < lis_~N); 22186#L545-4 lis_~i~0 := 1; 22187#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22260#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; 22277#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; 22276#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 22275#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22274#L548-3 assume !(lis_~j~0 < lis_~i~0); 22272#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22273#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 23040#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; 23039#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; 23037#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 23036#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23035#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; 23034#L549 assume !lis_#t~short11; 23030#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 23028#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23027#L548-3 assume !(lis_~j~0 < lis_~i~0); 22178#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22179#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22175#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; 22176#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; 22188#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 22171#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22172#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; 23414#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; 23413#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 23408#L548-2 [2018-12-02 14:33:46,016 INFO L796 eck$LassoCheckResult]: Loop: 23408#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23412#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; 23410#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; 23407#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 23408#L548-2 [2018-12-02 14:33:46,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash 317851267, now seen corresponding path program 17 times [2018-12-02 14:33:46,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:46,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:46,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 3 times [2018-12-02 14:33:46,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:46,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:33:46,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1513273348, now seen corresponding path program 18 times [2018-12-02 14:33:46,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:33:46,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:33:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:33:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 14:33:46,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:33:46,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:33:46,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 14:33:46,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-02 14:33:46,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:33:46,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:33:46,686 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-12-02 14:33:46,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,696 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-12-02 14:33:46,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-12-02 14:33:46,766 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-12-02 14:33:46,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,769 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-12-02 14:33:46,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,777 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-12-02 14:33:46,778 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-12-02 14:33:46,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:42 [2018-12-02 14:33:46,867 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 76 treesize of output 56 [2018-12-02 14:33:46,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,872 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 71 [2018-12-02 14:33:46,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,887 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 57 treesize of output 56 [2018-12-02 14:33:46,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:46,889 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-12-02 14:33:46,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:46,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:66 [2018-12-02 14:33:47,027 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 108 treesize of output 80 [2018-12-02 14:33:47,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:33:47,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,050 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:33:47,051 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 43 treesize of output 167 [2018-12-02 14:33:47,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,094 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 93 treesize of output 90 [2018-12-02 14:33:47,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,101 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 27 treesize of output 58 [2018-12-02 14:33:47,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:124, output treesize:105 [2018-12-02 14:33:47,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,420 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 169 treesize of output 176 [2018-12-02 14:33:47,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:33:47,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 262 [2018-12-02 14:33:47,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:33:47,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,483 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 121 treesize of output 124 [2018-12-02 14:33:47,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:33:47,508 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 122 [2018-12-02 14:33:47,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 14:33:47,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 14:33:47,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 14:33:47,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 14:33:47,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:179, output treesize:358 [2018-12-02 14:33:58,091 WARN L180 SmtUtils]: Spent 10.18 s on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-12-02 14:33:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 14:33:58,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:33:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-12-02 14:33:58,305 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-12-02 14:33:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 14:33:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 14:33:58,335 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. cyclomatic complexity: 570 Second operand 34 states. [2018-12-02 14:34:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:00,731 INFO L93 Difference]: Finished difference Result 1480 states and 2083 transitions. [2018-12-02 14:34:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 14:34:00,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1480 states and 2083 transitions. [2018-12-02 14:34:00,737 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 425 [2018-12-02 14:34:00,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1480 states to 1480 states and 2083 transitions. [2018-12-02 14:34:00,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1047 [2018-12-02 14:34:00,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1047 [2018-12-02 14:34:00,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1480 states and 2083 transitions. [2018-12-02 14:34:00,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:34:00,743 INFO L705 BuchiCegarLoop]: Abstraction has 1480 states and 2083 transitions. [2018-12-02 14:34:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states and 2083 transitions. [2018-12-02 14:34:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1354. [2018-12-02 14:34:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2018-12-02 14:34:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1905 transitions. [2018-12-02 14:34:00,759 INFO L728 BuchiCegarLoop]: Abstraction has 1354 states and 1905 transitions. [2018-12-02 14:34:00,759 INFO L608 BuchiCegarLoop]: Abstraction has 1354 states and 1905 transitions. [2018-12-02 14:34:00,759 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-12-02 14:34:00,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1354 states and 1905 transitions. [2018-12-02 14:34:00,762 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 409 [2018-12-02 14:34:00,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:34:00,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:34:00,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:00,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:34:00,763 INFO L794 eck$LassoCheckResult]: Stem: 25157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 25154#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; 25135#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 25136#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; 25145#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); 25155#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25156#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); 25152#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25153#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); 25169#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25168#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); 25166#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 25167#L545-3 assume !(lis_~i~0 < lis_~N); 25158#L545-4 lis_~i~0 := 1; 25159#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25229#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; 25245#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; 25244#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 25243#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25242#L548-3 assume !(lis_~j~0 < lis_~i~0); 25239#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25240#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26468#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; 26467#L549 assume !lis_#t~short11; 26465#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 26466#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26485#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; 26484#L549 assume !lis_#t~short11; 26483#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 25173#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26482#L548-3 assume !(lis_~j~0 < lis_~i~0); 26481#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25151#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25146#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; 25147#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; 25160#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 25141#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25142#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; 26488#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; 26469#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 25138#L548-2 [2018-12-02 14:34:00,763 INFO L796 eck$LassoCheckResult]: Loop: 25138#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26487#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; 26486#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; 26470#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 25138#L548-2 [2018-12-02 14:34:00,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2003402307, now seen corresponding path program 19 times [2018-12-02 14:34:00,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:34:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:34:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:34:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:34:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:34:00,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 4 times [2018-12-02 14:34:00,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:34:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:34:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:34:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:34:00,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1908219972, now seen corresponding path program 20 times [2018-12-02 14:34:00,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:34:00,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:34:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:34:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 14:34:02,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:02,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:34:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:34:02,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:34:02,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:34:02,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:34:02,060 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-12-02 14:34:02,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,068 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-12-02 14:34:02,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-12-02 14:34:02,149 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-12-02 14:34:02,151 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-12-02 14:34:02,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,161 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-12-02 14:34:02,163 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-12-02 14:34:02,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-12-02 14:34:02,275 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-12-02 14:34:02,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,280 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-12-02 14:34:02,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,297 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-12-02 14:34:02,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,301 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-12-02 14:34:02,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-12-02 14:34:02,398 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 76 treesize of output 64 [2018-12-02 14:34:02,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,402 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 27 treesize of output 58 [2018-12-02 14:34:02,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-12-02 14:34:02,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:02,425 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 27 treesize of output 94 [2018-12-02 14:34:02,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:02,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:69 [2018-12-02 14:34:03,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,174 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 113 treesize of output 101 [2018-12-02 14:34:03,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,202 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 57 treesize of output 107 [2018-12-02 14:34:03,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 84 [2018-12-02 14:34:03,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,262 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 40 treesize of output 108 [2018-12-02 14:34:03,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:78 [2018-12-02 14:34:03,419 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 127 treesize of output 97 [2018-12-02 14:34:03,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,425 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:03,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:03,457 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 169 [2018-12-02 14:34:03,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-12-02 14:34:03,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,570 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 112 treesize of output 117 [2018-12-02 14:34:03,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,578 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:03,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,580 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 44 treesize of output 103 [2018-12-02 14:34:03,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,604 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 112 treesize of output 117 [2018-12-02 14:34:03,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,608 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:03,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,611 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 93 [2018-12-02 14:34:03,612 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,636 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 112 treesize of output 107 [2018-12-02 14:34:03,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,648 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 122 [2018-12-02 14:34:03,649 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,675 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 98 treesize of output 93 [2018-12-02 14:34:03,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:03,681 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 34 treesize of output 141 [2018-12-02 14:34:03,682 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,702 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:03,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 14:34:03,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 14:34:03,811 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:140, output treesize:453 [2018-12-02 14:34:04,043 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-02 14:34:04,354 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-02 14:34:05,045 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-02 14:34:05,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,071 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 241 treesize of output 217 [2018-12-02 14:34:05,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 398 [2018-12-02 14:34:05,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2018-12-02 14:34:05,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,306 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 152 treesize of output 147 [2018-12-02 14:34:05,309 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:05,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,317 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 114 treesize of output 154 [2018-12-02 14:34:05,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,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 171 treesize of output 166 [2018-12-02 14:34:05,351 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:34:05,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,357 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 114 treesize of output 154 [2018-12-02 14:34:05,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,385 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 182 [2018-12-02 14:34:05,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:05,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 195 [2018-12-02 14:34:05,407 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,440 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:05,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:34:06,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,658 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 217 treesize of output 195 [2018-12-02 14:34:06,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 332 [2018-12-02 14:34:06,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-12-02 14:34:06,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,789 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 153 treesize of output 150 [2018-12-02 14:34:06,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,795 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 126 treesize of output 124 [2018-12-02 14:34:06,795 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:06,812 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:06,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,818 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 163 treesize of output 160 [2018-12-02 14:34:06,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:06,824 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 126 treesize of output 124 [2018-12-02 14:34:06,824 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:06,843 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:06,875 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:34:07,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,508 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 196 treesize of output 176 [2018-12-02 14:34:07,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,525 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 239 [2018-12-02 14:34:07,526 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:07,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,575 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 147 treesize of output 146 [2018-12-02 14:34:07,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:07,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2018-12-02 14:34:07,586 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:07,617 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:07,635 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:08,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,024 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 217 treesize of output 195 [2018-12-02 14:34:08,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 332 [2018-12-02 14:34:08,063 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-12-02 14:34:08,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,153 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 163 treesize of output 160 [2018-12-02 14:34:08,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,159 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 126 treesize of output 130 [2018-12-02 14:34:08,159 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:08,177 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:08,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,182 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 153 treesize of output 150 [2018-12-02 14:34:08,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:34:08,188 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 126 treesize of output 130 [2018-12-02 14:34:08,188 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 14:34:08,207 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:34:08,237 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:34:08,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-12-02 14:34:08,421 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:872, output treesize:891 [2018-12-02 14:34:08,730 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-02 14:34:09,099 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2018-12-02 14:34:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 14:34:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:34:09,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2018-12-02 14:34:09,659 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-12-02 14:34:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 14:34:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1691, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 14:34:09,690 INFO L87 Difference]: Start difference. First operand 1354 states and 1905 transitions. cyclomatic complexity: 602 Second operand 43 states. [2018-12-02 14:34:26,540 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-12-02 14:34:27,218 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2018-12-02 14:34:27,715 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2018-12-02 14:34:27,971 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-12-02 14:34:41,431 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 219 [2018-12-02 14:34:42,054 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 250 [2018-12-02 14:34:56,625 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 106 [2018-12-02 14:34:57,426 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2018-12-02 14:34:57,675 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2018-12-02 14:34:58,780 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 70 [2018-12-02 14:34:58,997 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2018-12-02 14:34:59,802 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 250 [2018-12-02 14:35:01,239 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 280 [2018-12-02 14:35:03,554 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 275 [2018-12-02 14:35:04,585 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-12-02 14:35:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:05,744 INFO L93 Difference]: Finished difference Result 1624 states and 2282 transitions. [2018-12-02 14:35:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-02 14:35:05,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1624 states and 2282 transitions. [2018-12-02 14:35:05,747 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 445 [2018-12-02 14:35:05,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1624 states to 1624 states and 2282 transitions. [2018-12-02 14:35:05,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1151 [2018-12-02 14:35:05,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2018-12-02 14:35:05,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1624 states and 2282 transitions. [2018-12-02 14:35:05,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:35:05,750 INFO L705 BuchiCegarLoop]: Abstraction has 1624 states and 2282 transitions. [2018-12-02 14:35:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states and 2282 transitions. [2018-12-02 14:35:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1381. [2018-12-02 14:35:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-12-02 14:35:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1935 transitions. [2018-12-02 14:35:05,771 INFO L728 BuchiCegarLoop]: Abstraction has 1381 states and 1935 transitions. [2018-12-02 14:35:05,771 INFO L608 BuchiCegarLoop]: Abstraction has 1381 states and 1935 transitions. [2018-12-02 14:35:05,771 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-12-02 14:35:05,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1381 states and 1935 transitions. [2018-12-02 14:35:05,774 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 413 [2018-12-02 14:35:05,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:35:05,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:35:05,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:05,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:35:05,775 INFO L794 eck$LassoCheckResult]: Stem: 28510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 28506#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; 28488#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 28489#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; 28497#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); 28507#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28520#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); 28504#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28505#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); 28521#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28508#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); 28509#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28519#L545-3 assume !(lis_~i~0 < lis_~N); 28511#L545-4 lis_~i~0 := 1; 28512#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28580#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; 28597#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; 28596#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 28595#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28594#L548-3 assume !(lis_~j~0 < lis_~i~0); 28591#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28592#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 29832#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; 29831#L549 assume !lis_#t~short11; 29829#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 29830#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 29868#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; 29820#L549 assume !lis_#t~short11; 28527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 28524#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28522#L548-3 assume !(lis_~j~0 < lis_~i~0); 28523#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28503#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28498#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; 28499#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; 28513#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 28494#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28495#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; 29867#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; 29865#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 28491#L548-2 [2018-12-02 14:35:05,775 INFO L796 eck$LassoCheckResult]: Loop: 28491#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 29862#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; 29860#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; 28490#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 28491#L548-2 [2018-12-02 14:35:05,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2003402307, now seen corresponding path program 21 times [2018-12-02 14:35:05,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:05,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:05,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2511484, now seen corresponding path program 1 times [2018-12-02 14:35:05,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:05,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:05,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1908219970, now seen corresponding path program 22 times [2018-12-02 14:35:05,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:05,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:05,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:31,078 WARN L180 SmtUtils]: Spent 25.09 s on a formula simplification. DAG size of input: 420 DAG size of output: 285 [2018-12-02 14:35:36,129 WARN L180 SmtUtils]: Spent 5.04 s on a formula simplification that was a NOOP. DAG size: 181 [2018-12-02 14:35:36,133 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:35:36,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:35:36,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:35:36,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:35:36,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:35:36,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:35:36,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:35:36,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:35:36,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration27_Lasso [2018-12-02 14:35:36,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:35:36,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:35:36,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:36,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,483 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 116 [2018-12-02 14:35:55,652 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2018-12-02 14:35:55,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:55,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:35:56,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:35:56,090 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:35:56,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:35:56,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:35:56,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:35:56,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:35:56,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:35:56,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:35:56,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:35:56,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:35:56,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:35:56,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:35:56,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:35:56,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:35:56,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:35:56,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:35:56,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:35:56,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:35:56,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:35:56,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:35:56,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:35:56,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:35:56,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:35:56,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:35:56,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:35:56,120 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:35:56,135 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:35:56,135 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 14:35:56,135 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:35:56,136 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:35:56,136 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:35:56,136 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-12-02 14:35:58,807 INFO L297 tatePredicateManager]: 110 out of 110 supporting invariants were superfluous and have been removed [2018-12-02 14:35:58,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:35:58,848 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-12-02 14:35:58,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-12-02 14:35:58,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 1611 states and 2289 transitions. Complement of second has 7 states. [2018-12-02 14:35:58,868 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-12-02 14:35:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 14:35:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 14:35:58,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-02 14:35:58,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:35:58,869 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:35:58,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:35:58,919 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 14:35:58,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-12-02 14:35:58,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 1626 states and 2269 transitions. Complement of second has 9 states. [2018-12-02 14:35:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 14:35:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 14:35:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-02 14:35:58,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-02 14:35:58,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:35:58,946 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:35:58,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:58,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:35:58,995 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 14:35:58,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606 Second operand 4 states. [2018-12-02 14:35:59,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1381 states and 1935 transitions. cyclomatic complexity: 606. Second operand 4 states. Result 2191 states and 3146 transitions. Complement of second has 8 states. [2018-12-02 14:35:59,023 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-12-02 14:35:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 14:35:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-12-02 14:35:59,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-02 14:35:59,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:35:59,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-02 14:35:59,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:35:59,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 8 letters. [2018-12-02 14:35:59,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:35:59,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2191 states and 3146 transitions. [2018-12-02 14:35:59,028 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 590 [2018-12-02 14:35:59,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2191 states to 1718 states and 2430 transitions. [2018-12-02 14:35:59,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 872 [2018-12-02 14:35:59,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 982 [2018-12-02 14:35:59,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1718 states and 2430 transitions. [2018-12-02 14:35:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:35:59,033 INFO L705 BuchiCegarLoop]: Abstraction has 1718 states and 2430 transitions. [2018-12-02 14:35:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states and 2430 transitions. [2018-12-02 14:35:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1258. [2018-12-02 14:35:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-12-02 14:35:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1794 transitions. [2018-12-02 14:35:59,043 INFO L728 BuchiCegarLoop]: Abstraction has 1258 states and 1794 transitions. [2018-12-02 14:35:59,043 INFO L608 BuchiCegarLoop]: Abstraction has 1258 states and 1794 transitions. [2018-12-02 14:35:59,043 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-12-02 14:35:59,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1258 states and 1794 transitions. [2018-12-02 14:35:59,045 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 383 [2018-12-02 14:35:59,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:35:59,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:35:59,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:59,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-12-02 14:35:59,046 INFO L794 eck$LassoCheckResult]: Stem: 36203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36200#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; 36182#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36183#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; 36189#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); 36201#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36202#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); 36198#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36199#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); 36217#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36215#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); 36216#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36211#L545-3 assume !(lis_~i~0 < lis_~N); 36213#L545-4 lis_~i~0 := 1; 36481#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36480#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; 36479#L549 assume !lis_#t~short11; 36478#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36477#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36476#L548-3 assume !(lis_~j~0 < lis_~i~0); 36475#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36474#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36473#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; 36471#L549 assume !lis_#t~short11; 36465#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36462#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36460#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; 36458#L549 assume !lis_#t~short11; 36457#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36456#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36455#L548-3 assume !(lis_~j~0 < lis_~i~0); 36454#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36453#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36452#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; 36450#L549 assume !lis_#t~short11; 36447#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36445#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36443#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; 36440#L549 assume !lis_#t~short11; 36429#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36436#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36432#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; 36426#L549 assume !lis_#t~short11; 36410#L549-2 [2018-12-02 14:35:59,046 INFO L796 eck$LassoCheckResult]: Loop: 36410#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36411#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36406#L548-3 assume !(lis_~j~0 < lis_~i~0); 36407#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36403#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36404#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; 36398#L549 assume !lis_#t~short11; 36400#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36470#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36469#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; 36468#L549 assume !lis_#t~short11; 36466#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 36463#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36433#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; 36434#L549 assume !lis_#t~short11; 36410#L549-2 [2018-12-02 14:35:59,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1944447434, now seen corresponding path program 3 times [2018-12-02 14:35:59,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:59,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:59,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2142895964, now seen corresponding path program 2 times [2018-12-02 14:35:59,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:59,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:35:59,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 950278279, now seen corresponding path program 4 times [2018-12-02 14:35:59,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:59,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:59,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:59,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 73 proven. 74 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 14:35:59,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:35:59,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:35:59,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:35:59,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:35:59,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:35:59,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:35:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 137 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 14:35:59,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:35:59,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-12-02 14:35:59,396 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-12-02 14:35:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 14:35:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-12-02 14:35:59,417 INFO L87 Difference]: Start difference. First operand 1258 states and 1794 transitions. cyclomatic complexity: 578 Second operand 23 states. [2018-12-02 14:35:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:59,737 INFO L93 Difference]: Finished difference Result 1234 states and 1751 transitions. [2018-12-02 14:35:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 14:35:59,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1751 transitions. [2018-12-02 14:35:59,740 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 275 [2018-12-02 14:35:59,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1084 states and 1561 transitions. [2018-12-02 14:35:59,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 695 [2018-12-02 14:35:59,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2018-12-02 14:35:59,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1084 states and 1561 transitions. [2018-12-02 14:35:59,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:35:59,742 INFO L705 BuchiCegarLoop]: Abstraction has 1084 states and 1561 transitions. [2018-12-02 14:35:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states and 1561 transitions. [2018-12-02 14:35:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 768. [2018-12-02 14:35:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-12-02 14:35:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1101 transitions. [2018-12-02 14:35:59,748 INFO L728 BuchiCegarLoop]: Abstraction has 768 states and 1101 transitions. [2018-12-02 14:35:59,748 INFO L608 BuchiCegarLoop]: Abstraction has 768 states and 1101 transitions. [2018-12-02 14:35:59,748 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-12-02 14:35:59,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 768 states and 1101 transitions. [2018-12-02 14:35:59,750 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 255 [2018-12-02 14:35:59,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:35:59,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:35:59,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:59,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:35:59,750 INFO L794 eck$LassoCheckResult]: Stem: 38917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38914#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; 38895#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 38896#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; 38905#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); 38915#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38916#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); 38912#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38913#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); 38929#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38928#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); 38927#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38926#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); 38925#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 38924#L545-3 assume !(lis_~i~0 < lis_~N); 38918#L545-4 lis_~i~0 := 1; 38919#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38946#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; 38959#L549 assume !lis_#t~short11; 38960#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 38970#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 38969#L548-3 assume !(lis_~j~0 < lis_~i~0); 38968#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 38967#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38966#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; 38963#L549 assume !lis_#t~short11; 38965#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 39445#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39444#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; 39443#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; 39034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 39035#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 38981#L548-3 assume !(lis_~j~0 < lis_~i~0); 38909#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 38910#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 38911#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; 39508#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; 39507#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 39506#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39505#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; 39503#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; 39502#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 39382#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39541#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; 39536#L549 [2018-12-02 14:35:59,750 INFO L796 eck$LassoCheckResult]: Loop: 39536#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; 39383#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 39384#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 39540#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; 39536#L549 [2018-12-02 14:35:59,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash 246233564, now seen corresponding path program 23 times [2018-12-02 14:35:59,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:35:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:35:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:35:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:36:00,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:36:00,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:36:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 14:36:00,826 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 14:36:00,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:36:00,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:36:00,830 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-12-02 14:36:00,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,837 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-12-02 14:36:00,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-12-02 14:36:00,864 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-12-02 14:36:00,865 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-12-02 14:36:00,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,872 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-12-02 14:36:00,873 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-12-02 14:36:00,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:00,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:32 [2018-12-02 14:36:00,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,940 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 54 treesize of output 63 [2018-12-02 14:36:00,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,953 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 37 treesize of output 58 [2018-12-02 14:36:00,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:00,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,972 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 41 treesize of output 59 [2018-12-02 14:36:00,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:00,984 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 37 treesize of output 66 [2018-12-02 14:36:00,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:00,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-12-02 14:36:01,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,068 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 72 treesize of output 79 [2018-12-02 14:36:01,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,084 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 3 case distinctions, treesize of input 44 treesize of output 89 [2018-12-02 14:36:01,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,111 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 59 treesize of output 75 [2018-12-02 14:36:01,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,128 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-12-02 14:36:01,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:81, output treesize:64 [2018-12-02 14:36:01,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,242 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 95 [2018-12-02 14:36:01,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,268 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 122 [2018-12-02 14:36:01,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,306 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 91 [2018-12-02 14:36:01,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,331 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 194 [2018-12-02 14:36:01,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:82 [2018-12-02 14:36:01,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,487 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 108 treesize of output 111 [2018-12-02 14:36:01,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,526 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 163 [2018-12-02 14:36:01,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,581 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 107 [2018-12-02 14:36:01,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,614 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 291 [2018-12-02 14:36:01,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:36:01,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:01,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:36:01,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:100 [2018-12-02 14:36:01,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,905 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 140 treesize of output 137 [2018-12-02 14:36:01,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:01,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:36:01,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,028 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 83 treesize of output 273 [2018-12-02 14:36:02,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-12-02 14:36:02,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:36:02,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-02 14:36:02,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,179 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:36:02,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,201 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 229 [2018-12-02 14:36:02,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:36:02,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:36:02,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,255 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 108 treesize of output 124 [2018-12-02 14:36:02,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,264 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:36:02,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:02,299 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 248 [2018-12-02 14:36:02,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 14:36:02,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 14:36:02,617 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-12-02 14:36:02,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-12-02 14:36:02,748 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:149, output treesize:465 [2018-12-02 14:36:03,115 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 84 [2018-12-02 14:36:03,414 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-02 14:36:03,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 107 treesize of output 91 [2018-12-02 14:36:03,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,731 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 149 [2018-12-02 14:36:03,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 14:36:03,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-12-02 14:36:03,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 89 [2018-12-02 14:36:03,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:36:03,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:03,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 118 treesize of output 100 [2018-12-02 14:36:03,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:03,972 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 180 [2018-12-02 14:36:03,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:04,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 77 dim-0 vars, End of recursive call: 77 dim-0 vars, and 51 xjuncts. [2018-12-02 14:36:08,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-12-02 14:36:08,118 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 158 [2018-12-02 14:36:08,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:08,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:08,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:08,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,235 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:08,267 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:08,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:08,296 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 7 xjuncts. [2018-12-02 14:36:08,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-12-02 14:36:08,320 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-12-02 14:36:08,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:08,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,390 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:08,425 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 7 xjuncts. [2018-12-02 14:36:08,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 210 [2018-12-02 14:36:08,495 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 14:36:08,507 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 64 xjuncts. [2018-12-02 14:36:08,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:08,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,577 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 210 [2018-12-02 14:36:08,643 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 14:36:08,656 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 64 xjuncts. [2018-12-02 14:36:08,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:08,726 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,733 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:08,795 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,802 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-12-02 14:36:08,821 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-12-02 14:36:08,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:08,889 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,895 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:08,926 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:08,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-12-02 14:36:08,987 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:08,993 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 24 xjuncts. [2018-12-02 14:36:08,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:08,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-12-02 14:36:09,028 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-12-02 14:36:09,095 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,102 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 24 xjuncts. [2018-12-02 14:36:09,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:09,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,168 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:09,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:09,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,239 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:09,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,271 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:09,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,334 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:09,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,362 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,393 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-12-02 14:36:09,424 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 132 [2018-12-02 14:36:09,461 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-02 14:36:09,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,489 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2018-12-02 14:36:09,511 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2018-12-02 14:36:09,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,543 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 180 [2018-12-02 14:36:09,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:09,614 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 206 [2018-12-02 14:36:09,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,683 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 22 xjuncts. [2018-12-02 14:36:09,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,712 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:09,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,782 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:09,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:09,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:09,864 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:09,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:09,899 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:09,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 210 [2018-12-02 14:36:09,970 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 14:36:09,984 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 64 xjuncts. [2018-12-02 14:36:09,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:09,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:10,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:10,063 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:10,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 158 [2018-12-02 14:36:10,118 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:10,119 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:10,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 206 [2018-12-02 14:36:10,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:10,197 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 24 xjuncts. [2018-12-02 14:36:10,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 180 [2018-12-02 14:36:10,260 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:10,261 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:10,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 206 [2018-12-02 14:36:10,343 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:10,350 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:10,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 90 treesize of output 206 [2018-12-02 14:36:10,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 14:36:10,425 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 32 xjuncts. [2018-12-02 14:36:10,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 136 [2018-12-02 14:36:10,455 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 6 xjuncts. [2018-12-02 14:36:10,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 136 [2018-12-02 14:36:10,483 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 7 xjuncts. [2018-12-02 14:36:10,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 180 [2018-12-02 14:36:10,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:10,533 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:10,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 140 [2018-12-02 14:36:10,567 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 11 xjuncts. [2018-12-02 14:36:10,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 158 [2018-12-02 14:36:10,611 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:10,612 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:10,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 140 [2018-12-02 14:36:10,645 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 11 xjuncts. [2018-12-02 14:36:10,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 140 [2018-12-02 14:36:10,680 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 11 xjuncts. [2018-12-02 14:36:10,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:36:10,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 180 [2018-12-02 14:36:10,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 14:36:10,733 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 8 xjuncts. [2018-12-02 14:36:42,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 14:36:42,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:36:42,194 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 20 variables, input treesize:487, output treesize:8 [2018-12-02 14:36:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 14:36:42,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:36:42,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2018-12-02 14:36:42,259 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:36:42,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2224444, now seen corresponding path program 2 times [2018-12-02 14:36:42,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:42,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:42,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-02 14:36:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 14:36:42,396 INFO L87 Difference]: Start difference. First operand 768 states and 1101 transitions. cyclomatic complexity: 358 Second operand 38 states. [2018-12-02 14:36:44,989 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-12-02 14:36:45,201 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2018-12-02 14:36:45,985 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 97 [2018-12-02 14:36:46,445 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2018-12-02 14:36:46,806 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 105 [2018-12-02 14:36:47,120 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-12-02 14:36:47,747 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 108 [2018-12-02 14:36:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:48,320 INFO L93 Difference]: Finished difference Result 904 states and 1295 transitions. [2018-12-02 14:36:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 14:36:48,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1295 transitions. [2018-12-02 14:36:48,322 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 289 [2018-12-02 14:36:48,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 904 states and 1295 transitions. [2018-12-02 14:36:48,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2018-12-02 14:36:48,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2018-12-02 14:36:48,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 1295 transitions. [2018-12-02 14:36:48,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:36:48,324 INFO L705 BuchiCegarLoop]: Abstraction has 904 states and 1295 transitions. [2018-12-02 14:36:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 1295 transitions. [2018-12-02 14:36:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 764. [2018-12-02 14:36:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-02 14:36:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1094 transitions. [2018-12-02 14:36:48,330 INFO L728 BuchiCegarLoop]: Abstraction has 764 states and 1094 transitions. [2018-12-02 14:36:48,330 INFO L608 BuchiCegarLoop]: Abstraction has 764 states and 1094 transitions. [2018-12-02 14:36:48,330 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-12-02 14:36:48,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 764 states and 1094 transitions. [2018-12-02 14:36:48,331 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 255 [2018-12-02 14:36:48,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:36:48,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:36:48,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:48,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2018-12-02 14:36:48,331 INFO L794 eck$LassoCheckResult]: Stem: 40825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40822#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; 40803#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40804#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; 40813#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); 40823#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40824#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); 40820#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40821#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); 40837#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40836#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); 40835#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40834#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); 40833#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 40832#L545-3 assume !(lis_~i~0 < lis_~N); 40826#L545-4 lis_~i~0 := 1; 40827#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40894#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; 40892#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; 40891#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 40890#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40889#L548-3 assume !(lis_~j~0 < lis_~i~0); 40887#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40886#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40885#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; 40883#L549 assume !lis_#t~short11; 40882#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40881#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40880#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; 40879#L549 assume !lis_#t~short11; 40878#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40877#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40876#L548-3 assume !(lis_~j~0 < lis_~i~0); 40875#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40874#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40873#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; 40871#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; 40869#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40868#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40867#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; 40865#L549 assume !lis_#t~short11; 40866#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40932#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40931#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; 40928#L549 assume !lis_#t~short11; 40929#L549-2 [2018-12-02 14:36:48,331 INFO L796 eck$LassoCheckResult]: Loop: 40929#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40927#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 41087#L548-3 assume !(lis_~j~0 < lis_~i~0); 41085#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 40973#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 40974#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; 40968#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; 40969#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40964#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40963#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; 40961#L549 assume !lis_#t~short11; 40962#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 40980#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 40981#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; 41099#L549 assume !lis_#t~short11; 40929#L549-2 [2018-12-02 14:36:48,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash -946079406, now seen corresponding path program 24 times [2018-12-02 14:36:48,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:48,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:36:48,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:36:48,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:36:48,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 14:36:48,892 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-12-02 14:36:48,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:36:48,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:36:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 14:36:49,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:36:49,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2018-12-02 14:36:49,304 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:36:49,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1462837594, now seen corresponding path program 3 times [2018-12-02 14:36:49,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:49,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:49,460 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2018-12-02 14:36:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 14:36:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 14:36:49,490 INFO L87 Difference]: Start difference. First operand 764 states and 1094 transitions. cyclomatic complexity: 355 Second operand 35 states. [2018-12-02 14:36:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:53,325 INFO L93 Difference]: Finished difference Result 1373 states and 1942 transitions. [2018-12-02 14:36:53,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 14:36:53,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1373 states and 1942 transitions. [2018-12-02 14:36:53,333 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 479 [2018-12-02 14:36:53,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1373 states to 1373 states and 1942 transitions. [2018-12-02 14:36:53,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 826 [2018-12-02 14:36:53,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 826 [2018-12-02 14:36:53,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1373 states and 1942 transitions. [2018-12-02 14:36:53,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:36:53,342 INFO L705 BuchiCegarLoop]: Abstraction has 1373 states and 1942 transitions. [2018-12-02 14:36:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states and 1942 transitions. [2018-12-02 14:36:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1253. [2018-12-02 14:36:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-12-02 14:36:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1792 transitions. [2018-12-02 14:36:53,357 INFO L728 BuchiCegarLoop]: Abstraction has 1253 states and 1792 transitions. [2018-12-02 14:36:53,357 INFO L608 BuchiCegarLoop]: Abstraction has 1253 states and 1792 transitions. [2018-12-02 14:36:53,357 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-12-02 14:36:53,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1792 transitions. [2018-12-02 14:36:53,359 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 445 [2018-12-02 14:36:53,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:36:53,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:36:53,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:53,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-12-02 14:36:53,359 INFO L794 eck$LassoCheckResult]: Stem: 43221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 43218#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; 43198#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 43199#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; 43208#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); 43219#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43220#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); 43216#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43217#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); 43234#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43233#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); 43232#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43231#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); 43230#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 43229#L545-3 assume !(lis_~i~0 < lis_~N); 43222#L545-4 lis_~i~0 := 1; 43223#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43250#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; 43264#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; 43263#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 43262#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43261#L548-3 assume !(lis_~j~0 < lis_~i~0); 43259#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43260#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43390#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; 43388#L549 assume !lis_#t~short11; 43389#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 43661#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43660#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; 43659#L549 assume !lis_#t~short11; 43658#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 43657#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43656#L548-3 assume !(lis_~j~0 < lis_~i~0); 43655#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43654#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43653#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; 43651#L549 assume !lis_#t~short11; 43650#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 43649#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43648#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; 43647#L549 assume !lis_#t~short11; 43646#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 43645#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43644#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; 43641#L549 assume !lis_#t~short11; 43642#L549-2 [2018-12-02 14:36:53,359 INFO L796 eck$LassoCheckResult]: Loop: 43642#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 44367#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44351#L548-3 assume !(lis_~j~0 < lis_~i~0); 44348#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 44347#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 44346#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; 44344#L549 assume !lis_#t~short11; 44343#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 44341#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44342#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; 44379#L549 assume !lis_#t~short11; 44378#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 44377#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44376#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; 44375#L549 assume !lis_#t~short11; 43642#L549-2 [2018-12-02 14:36:53,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -266021036, now seen corresponding path program 25 times [2018-12-02 14:36:53,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:53,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2142895964, now seen corresponding path program 3 times [2018-12-02 14:36:53,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:53,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1723283369, now seen corresponding path program 26 times [2018-12-02 14:36:53,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:36:53,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:36:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:53,538 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-12-02 14:37:02,435 WARN L180 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 398 DAG size of output: 272 [2018-12-02 14:37:04,278 WARN L180 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 165 [2018-12-02 14:37:04,280 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:37:04,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:37:04,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:37:04,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:37:04,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:37:04,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:37:04,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:37:04,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:37:04,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration31_Lasso [2018-12-02 14:37:04,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:37:04,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:37:04,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:04,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:06,748 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 124 [2018-12-02 14:37:06,905 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2018-12-02 14:37:06,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:06,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:06,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:06,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:06,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:37:07,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:37:07,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:37:07,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,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-12-02 14:37:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:37:07,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:37:07,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:37:07,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:37:07,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:37:07,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:37:07,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:37:07,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:37:07,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:37:07,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:37:07,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:37:07,321 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:37:07,331 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 14:37:07,331 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 14:37:07,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:37:07,331 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:37:07,332 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:37:07,332 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 7 Supporting invariants [] [2018-12-02 14:37:07,754 INFO L297 tatePredicateManager]: 111 out of 112 supporting invariants were superfluous and have been removed [2018-12-02 14:37:07,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:07,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:07,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:37:07,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-12-02 14:37:07,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-12-02 14:37:07,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 1492 states and 2124 transitions. Complement of second has 13 states. [2018-12-02 14:37:07,959 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-12-02 14:37:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:37:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-12-02 14:37:07,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 52 transitions. Stem has 45 letters. Loop has 15 letters. [2018-12-02 14:37:07,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:07,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:37:07,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:07,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:37:08,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 7 loop predicates [2018-12-02 14:37:08,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-12-02 14:37:08,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 1647 states and 2362 transitions. Complement of second has 25 states. [2018-12-02 14:37:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2018-12-02 14:37:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:37:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2018-12-02 14:37:08,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 87 transitions. Stem has 45 letters. Loop has 15 letters. [2018-12-02 14:37:08,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:08,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:37:08,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:37:08,400 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 7 loop predicates [2018-12-02 14:37:08,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-12-02 14:37:08,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 2854 states and 3959 transitions. Complement of second has 20 states. [2018-12-02 14:37:08,487 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-12-02 14:37:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:37:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-12-02 14:37:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 56 transitions. Stem has 45 letters. Loop has 15 letters. [2018-12-02 14:37:08,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:08,488 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:37:08,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:37:08,608 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.4 stem predicates 7 loop predicates [2018-12-02 14:37:08,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-12-02 14:37:08,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580. Second operand 12 states. Result 4486 states and 6387 transitions. Complement of second has 28 states. [2018-12-02 14:37:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2018-12-02 14:37:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:37:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2018-12-02 14:37:08,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 91 transitions. Stem has 45 letters. Loop has 15 letters. [2018-12-02 14:37:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:08,857 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:37:08,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:08,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:37:08,981 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2018-12-02 14:37:08,982 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. [2018-12-02 14:37:09,511 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 1253 states and 1792 transitions. cyclomatic complexity: 580 Second operand 12 states. Result 17383 states and 31060 transitions. Complement of second has 91 states 15 powerset states76 rank states. The highest rank that occured is 5 [2018-12-02 14:37:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 4 stem states 10 non-accepting loop states 2 accepting loop states [2018-12-02 14:37:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 14:37:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 184 transitions. [2018-12-02 14:37:09,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 45 letters. Loop has 15 letters. [2018-12-02 14:37:09,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:09,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 60 letters. Loop has 15 letters. [2018-12-02 14:37:09,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:09,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 184 transitions. Stem has 45 letters. Loop has 30 letters. [2018-12-02 14:37:09,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:37:09,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17383 states and 31060 transitions. [2018-12-02 14:37:09,588 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 2447 [2018-12-02 14:37:09,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17383 states to 11892 states and 22197 transitions. [2018-12-02 14:37:09,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1991 [2018-12-02 14:37:09,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3766 [2018-12-02 14:37:09,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11892 states and 22197 transitions. [2018-12-02 14:37:09,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:37:09,622 INFO L705 BuchiCegarLoop]: Abstraction has 11892 states and 22197 transitions. [2018-12-02 14:37:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states and 22197 transitions. [2018-12-02 14:37:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6056. [2018-12-02 14:37:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2018-12-02 14:37:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 12487 transitions. [2018-12-02 14:37:09,688 INFO L728 BuchiCegarLoop]: Abstraction has 6056 states and 12487 transitions. [2018-12-02 14:37:09,688 INFO L608 BuchiCegarLoop]: Abstraction has 6056 states and 12487 transitions. [2018-12-02 14:37:09,688 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-12-02 14:37:09,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6056 states and 12487 transitions. [2018-12-02 14:37:09,698 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1516 [2018-12-02 14:37:09,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:37:09,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:37:09,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:37:09,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 14:37:09,699 INFO L794 eck$LassoCheckResult]: Stem: 74008#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74006#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; 73982#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 73983#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; 73991#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); 74004#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74005#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); 74007#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74021#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); 74020#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74019#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); 74018#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74017#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); 74016#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 74015#L545-3 assume !(lis_~i~0 < lis_~N); 74009#L545-4 lis_~i~0 := 1; 74010#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74063#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; 74062#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; 74060#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 74058#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74056#L548-3 assume !(lis_~j~0 < lis_~i~0); 74053#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74051#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74049#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; 74046#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; 74043#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 74041#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74042#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; 74038#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; 74034#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 74035#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74030#L548-3 assume !(lis_~j~0 < lis_~i~0); 74027#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74029#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 79102#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; 79097#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; 79098#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 77719#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 75792#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; 79322#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; 74402#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 78782#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79321#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; 79017#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; 74012#L549-2 [2018-12-02 14:37:09,699 INFO L796 eck$LassoCheckResult]: Loop: 74012#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 79674#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 77882#L548-3 assume !(lis_~j~0 < lis_~i~0); 79352#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 79782#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 79783#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; 79774#L549 assume !lis_#t~short11; 79704#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 73989#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73990#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; 79819#L549 assume !lis_#t~short11; 79696#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 79739#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79808#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; 79809#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; 79682#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 79683#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79680#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; 79681#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; 74012#L549-2 [2018-12-02 14:37:09,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash 373917522, now seen corresponding path program 3 times [2018-12-02 14:37:09,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:37:09,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:37:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:37:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:37:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:37:09,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1851300031, now seen corresponding path program 5 times [2018-12-02 14:37:09,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:37:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:37:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:37:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:37:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:37:09,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1538295246, now seen corresponding path program 27 times [2018-12-02 14:37:09,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:37:09,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:37:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:37:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 1 proven. 217 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 14:37:10,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:37:10,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/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-12-02 14:37:10,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:37:11,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 14:37:11,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:37:11,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:37:11,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,351 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-12-02 14:37:11,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,362 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-12-02 14:37:11,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-02 14:37:11,611 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 81 treesize of output 61 [2018-12-02 14:37:11,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,617 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 56 [2018-12-02 14:37:11,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,635 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 58 treesize of output 67 [2018-12-02 14:37:11,637 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-12-02 14:37:11,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:11,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:105, output treesize:78 [2018-12-02 14:37:11,841 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 115 [2018-12-02 14:37:11,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:11,908 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 3 case distinctions, treesize of input 46 treesize of output 140 [2018-12-02 14:37:11,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-02 14:37:12,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,015 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 111 [2018-12-02 14:37:12,020 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 88 treesize of output 62 [2018-12-02 14:37:12,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,056 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 79 treesize of output 94 [2018-12-02 14:37:12,059 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 61 treesize of output 40 [2018-12-02 14:37:12,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:37:12,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:37:12,131 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:155, output treesize:171 [2018-12-02 14:37:12,519 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-02 14:37:12,673 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 117 treesize of output 101 [2018-12-02 14:37:12,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,691 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 0 case distinctions, treesize of input 39 treesize of output 109 [2018-12-02 14:37:12,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:12,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 89 [2018-12-02 14:37:12,725 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 34 treesize of output 18 [2018-12-02 14:37:12,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:12,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:144, output treesize:82 [2018-12-02 14:37:14,144 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 149 treesize of output 137 [2018-12-02 14:37:14,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,184 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 40 treesize of output 132 [2018-12-02 14:37:14,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:37:14,280 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 131 [2018-12-02 14:37:14,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,285 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 87 treesize of output 104 [2018-12-02 14:37:14,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:14,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:14,319 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 120 treesize of output 121 [2018-12-02 14:37:14,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:37:14,326 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 87 treesize of output 116 [2018-12-02 14:37:14,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:37:14,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:37:14,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:37:14,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 14:37:14,447 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:170, output treesize:285 [2018-12-02 14:37:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 50 proven. 151 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 14:37:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:37:14,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2018-12-02 14:37:15,887 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2018-12-02 14:37:16,499 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-02 14:37:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-02 14:37:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2101, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 14:37:16,500 INFO L87 Difference]: Start difference. First operand 6056 states and 12487 transitions. cyclomatic complexity: 6548 Second operand 49 states. [2018-12-02 14:37:18,839 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2018-12-02 14:37:20,803 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2018-12-02 14:37:22,364 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-02 14:37:24,156 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-12-02 14:37:24,517 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2018-12-02 14:37:24,917 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-12-02 14:37:25,194 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2018-12-02 14:37:25,697 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2018-12-02 14:37:25,921 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-12-02 14:37:26,420 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 14:37:27,084 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2018-12-02 14:37:27,444 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-02 14:37:27,846 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-12-02 14:37:28,068 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-12-02 14:37:28,284 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-12-02 14:37:28,510 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-12-02 14:37:28,906 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2018-12-02 14:37:29,405 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2018-12-02 14:37:29,935 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2018-12-02 14:37:30,114 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-12-02 14:37:30,331 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-12-02 14:37:30,572 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-02 14:37:31,238 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-12-02 14:37:31,480 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2018-12-02 14:37:31,813 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 14:37:32,045 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-02 14:37:32,387 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-12-02 14:37:33,352 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2018-12-02 14:37:33,782 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2018-12-02 14:37:34,033 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-12-02 14:37:36,500 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-12-02 14:37:36,906 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-12-02 14:37:37,288 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-02 14:37:37,453 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-12-02 14:37:37,663 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-02 14:37:38,375 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-12-02 14:37:38,830 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2018-12-02 14:37:39,431 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-02 14:37:40,121 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-12-02 14:37:41,139 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-12-02 14:37:41,384 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-12-02 14:37:41,577 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2018-12-02 14:37:41,796 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-12-02 14:37:42,374 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2018-12-02 14:37:42,673 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-02 14:37:42,926 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-02 14:37:43,194 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-02 14:37:43,847 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-02 14:37:44,298 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2018-12-02 14:37:44,512 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-12-02 14:37:44,719 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-12-02 14:37:45,204 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-02 14:37:45,445 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-12-02 14:37:48,122 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-12-02 14:37:48,326 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 14:37:48,568 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2018-12-02 14:37:51,058 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-12-02 14:37:51,404 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-12-02 14:37:51,961 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-12-02 14:37:52,685 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-12-02 14:37:52,951 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2018-12-02 14:37:53,242 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 77 [2018-12-02 14:37:54,873 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-02 14:37:55,474 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 80 [2018-12-02 14:37:55,668 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-12-02 14:37:55,892 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 85 [2018-12-02 14:37:56,806 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2018-12-02 14:37:57,112 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-12-02 14:37:57,398 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-12-02 14:37:57,767 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 78 [2018-12-02 14:37:57,953 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-12-02 14:37:58,205 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 87 [2018-12-02 14:37:59,095 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 91 [2018-12-02 14:37:59,333 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 117 [2018-12-02 14:37:59,628 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2018-12-02 14:38:00,008 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 85 [2018-12-02 14:38:00,227 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 80 [2018-12-02 14:38:00,407 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2018-12-02 14:38:00,703 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-12-02 14:38:00,968 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-12-02 14:38:01,219 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-12-02 14:38:01,497 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2018-12-02 14:38:01,851 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-12-02 14:38:02,113 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-12-02 14:38:02,445 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-12-02 14:38:02,664 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-12-02 14:38:03,602 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-12-02 14:38:04,114 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-02 14:38:05,008 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 76 [2018-12-02 14:38:05,877 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-12-02 14:38:06,304 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-12-02 14:38:09,699 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-12-02 14:38:10,434 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 76 [2018-12-02 14:38:10,614 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-12-02 14:38:10,898 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 80 [2018-12-02 14:38:11,091 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-12-02 14:38:11,356 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2018-12-02 14:38:11,596 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-12-02 14:38:11,822 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-02 14:38:12,044 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-12-02 14:38:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:38:12,596 INFO L93 Difference]: Finished difference Result 34724 states and 67110 transitions. [2018-12-02 14:38:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 373 states. [2018-12-02 14:38:12,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34724 states and 67110 transitions. [2018-12-02 14:38:12,679 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 7611 [2018-12-02 14:38:12,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34724 states to 34724 states and 67110 transitions. [2018-12-02 14:38:12,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9644 [2018-12-02 14:38:12,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9644 [2018-12-02 14:38:12,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34724 states and 67110 transitions. [2018-12-02 14:38:12,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:38:12,761 INFO L705 BuchiCegarLoop]: Abstraction has 34724 states and 67110 transitions. [2018-12-02 14:38:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34724 states and 67110 transitions. [2018-12-02 14:38:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34724 to 19607. [2018-12-02 14:38:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2018-12-02 14:38:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 40470 transitions. [2018-12-02 14:38:13,016 INFO L728 BuchiCegarLoop]: Abstraction has 19607 states and 40470 transitions. [2018-12-02 14:38:13,016 INFO L608 BuchiCegarLoop]: Abstraction has 19607 states and 40470 transitions. [2018-12-02 14:38:13,016 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-12-02 14:38:13,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19607 states and 40470 transitions. [2018-12-02 14:38:13,050 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 4679 [2018-12-02 14:38:13,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:38:13,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:38:13,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:38:13,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 1, 1, 1, 1] [2018-12-02 14:38:13,051 INFO L794 eck$LassoCheckResult]: Stem: 115750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115748#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; 115723#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 115724#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; 115733#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); 115746#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115747#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); 115749#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115766#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); 115765#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115764#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); 115763#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115761#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); 115762#L545-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 115757#L545-3 assume !(lis_~i~0 < lis_~N); 115759#L545-4 lis_~i~0 := 1; 115823#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 115824#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; 115818#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; 115819#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 115810#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115811#L548-3 assume !(lis_~j~0 < lis_~i~0); 115802#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 115798#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 115799#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; 115789#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; 115790#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 115836#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115837#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; 115779#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; 115780#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 118495#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115770#L548-3 assume !(lis_~j~0 < lis_~i~0); 115771#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 128991#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 127651#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; 127652#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; 128792#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 128787#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 121556#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; 129592#L549 assume !lis_#t~short11; 119716#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 129817#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 129815#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; 129813#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; 128196#L549-2 [2018-12-02 14:38:13,051 INFO L796 eck$LassoCheckResult]: Loop: 128196#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 133668#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 115859#L548-3 assume !(lis_~j~0 < lis_~i~0); 115860#L547-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 133798#L547-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 134317#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; 134157#L549 assume !lis_#t~short11; 133830#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 134341#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134336#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; 134337#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; 134330#L549-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;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); 134284#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134328#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; 134227#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; 134215#L549-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 134224#L548-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 134278#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; 134273#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; 128196#L549-2 [2018-12-02 14:38:13,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash 375824146, now seen corresponding path program 28 times [2018-12-02 14:38:13,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:38:13,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:38:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:13,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:38:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:38:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 3 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:38:13,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:38:13,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66b1b61e-0514-4987-bd12-6c0bb5390ae6/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:38:13,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:38:13,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:38:13,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:38:13,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:38:13,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:13,935 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-12-02 14:38:13,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:13,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:13,947 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-12-02 14:38:13,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:13,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:13,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:13,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 14:38:13,992 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 59 treesize of output 36 [2018-12-02 14:38:13,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,000 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-12-02 14:38:14,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:38:14,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-12-02 14:38:14,009 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-12-02 14:38:14,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,018 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 37 treesize of output 38 [2018-12-02 14:38:14,019 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-12-02 14:38:14,019 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:38:14,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:38:14,047 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:77 [2018-12-02 14:38:14,174 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 109 treesize of output 81 [2018-12-02 14:38:14,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,198 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 172 [2018-12-02 14:38:14,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:38:14,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-12-02 14:38:14,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,243 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-12-02 14:38:14,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,255 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 68 treesize of output 67 [2018-12-02 14:38:14,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,259 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-12-02 14:38:14,259 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,267 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:38:14,349 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 96 treesize of output 72 [2018-12-02 14:38:14,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,352 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 56 [2018-12-02 14:38:14,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,370 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 55 treesize of output 54 [2018-12-02 14:38:14,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,373 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-12-02 14:38:14,373 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,381 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,390 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:38:14,430 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:206, output treesize:223 [2018-12-02 14:38:14,765 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-12-02 14:38:14,864 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 126 [2018-12-02 14:38:14,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,874 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 0 case distinctions, treesize of input 47 treesize of output 158 [2018-12-02 14:38:14,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,899 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 94 treesize of output 107 [2018-12-02 14:38:14,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:14,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-12-02 14:38:14,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:14,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,070 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 126 [2018-12-02 14:38:15,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,081 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 0 case distinctions, treesize of input 47 treesize of output 158 [2018-12-02 14:38:15,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,106 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 94 treesize of output 107 [2018-12-02 14:38:15,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,109 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:15,110 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 95 treesize of output 82 [2018-12-02 14:38:15,110 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,122 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,212 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 173 treesize of output 136 [2018-12-02 14:38:15,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,216 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:15,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,247 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 312 [2018-12-02 14:38:15,248 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-12-02 14:38:15,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,315 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 139 treesize of output 148 [2018-12-02 14:38:15,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,320 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 102 [2018-12-02 14:38:15,320 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,332 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,341 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 135 [2018-12-02 14:38:15,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,349 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 123 treesize of output 87 [2018-12-02 14:38:15,349 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,362 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,385 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:38:15,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:38:15,419 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:492, output treesize:216 [2018-12-02 14:38:15,601 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 115 [2018-12-02 14:38:15,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,665 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 220 [2018-12-02 14:38:15,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2018-12-02 14:38:15,950 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 121 treesize of output 122 [2018-12-02 14:38:15,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,959 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 82 treesize of output 143 [2018-12-02 14:38:15,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:15,994 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 126 treesize of output 131 [2018-12-02 14:38:15,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:15,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,009 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 2 case distinctions, treesize of input 43 treesize of output 97 [2018-12-02 14:38:16,010 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 14:38:16,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,046 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 129 treesize of output 130 [2018-12-02 14:38:16,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 118 [2018-12-02 14:38:16,075 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,096 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,111 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 113 treesize of output 116 [2018-12-02 14:38:16,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,128 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 4 case distinctions, treesize of input 66 treesize of output 104 [2018-12-02 14:38:16,129 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-02 14:38:16,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:38:16,178 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 106 treesize of output 111 [2018-12-02 14:38:16,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-12-02 14:38:16,183 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,202 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,212 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 113 treesize of output 126 [2018-12-02 14:38:16,214 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:16,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,218 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 67 treesize of output 84 [2018-12-02 14:38:16,218 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,235 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,244 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 113 treesize of output 116 [2018-12-02 14:38:16,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,247 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:16,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,248 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 57 treesize of output 79 [2018-12-02 14:38:16,249 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:38:16,264 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:38:16,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,275 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 131 [2018-12-02 14:38:16,277 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:16,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,280 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 53 treesize of output 68 [2018-12-02 14:38:16,280 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,296 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:16,395 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 6 xjuncts. [2018-12-02 14:38:16,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, 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 101 [2018-12-02 14:38:16,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:16,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,012 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 118 [2018-12-02 14:38:17,012 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-12-02 14:38:17,084 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-12-02 14:38:17,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,097 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 4 case distinctions, treesize of input 29 treesize of output 62 [2018-12-02 14:38:17,098 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 4 xjuncts. [2018-12-02 14:38:17,128 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:38:17,136 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 81 treesize of output 86 [2018-12-02 14:38:17,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,141 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-12-02 14:38:17,141 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,155 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,163 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 83 treesize of output 98 [2018-12-02 14:38:17,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,166 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:17,167 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 39 treesize of output 54 [2018-12-02 14:38:17,167 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,180 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,188 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 83 treesize of output 98 [2018-12-02 14:38:17,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:17,191 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 39 treesize of output 42 [2018-12-02 14:38:17,191 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,203 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,257 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 14:38:17,690 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 105 [2018-12-02 14:38:17,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,725 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 118 [2018-12-02 14:38:17,725 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 8 xjuncts. [2018-12-02 14:38:17,792 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-12-02 14:38:17,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,807 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 66 [2018-12-02 14:38:17,808 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-12-02 14:38:17,871 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:38:17,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,878 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 83 treesize of output 98 [2018-12-02 14:38:17,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,882 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:17,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,884 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 39 treesize of output 74 [2018-12-02 14:38:17,884 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,898 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,906 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 81 treesize of output 86 [2018-12-02 14:38:17,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,913 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 29 treesize of output 96 [2018-12-02 14:38:17,913 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,929 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,936 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 83 treesize of output 98 [2018-12-02 14:38:17,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,939 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 14:38:17,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 14:38:17,940 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 39 treesize of output 62 [2018-12-02 14:38:17,941 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 14:38:17,954 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:38:18,014 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 14:38:18,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 57 dim-0 vars, and 14 xjuncts. [2018-12-02 14:38:18,341 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 15 variables, input treesize:402, output treesize:1429 [2018-12-02 14:38:29,932 WARN L180 SmtUtils]: Spent 11.39 s on a formula simplification. DAG size of input: 489 DAG size of output: 424 [2018-12-02 14:38:30,580 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 437 [2018-12-02 14:38:38,526 WARN L180 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 456 DAG size of output: 451 [2018-12-02 14:38:39,077 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2018-12-02 14:38:39,621 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 348 [2018-12-02 14:38:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 14:38:39,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:38:39,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-12-02 14:38:39,758 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:38:39,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1980647869, now seen corresponding path program 6 times [2018-12-02 14:38:39,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:38:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:38:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:39,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:38:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:38:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:38:41,199 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 222 DAG size of output: 165 [2018-12-02 14:38:41,989 WARN L180 SmtUtils]: Spent 783.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-02 14:38:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 14:38:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 14:38:41,989 INFO L87 Difference]: Start difference. First operand 19607 states and 40470 transitions. cyclomatic complexity: 21190 Second operand 39 states. [2018-12-02 14:38:44,411 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-12-02 14:38:44,574 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-12-02 14:38:45,056 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2018-12-02 14:38:46,066 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-12-02 14:38:46,067 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.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:65) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) 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) ... 38 more [2018-12-02 14:38:46,069 INFO L168 Benchmark]: Toolchain (without parser) took 525709.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 949.6 MB in the beginning and 659.7 MB in the end (delta: 289.8 MB). Peak memory consumption was 516.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: Boogie Preprocessor took 15.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: RCFGBuilder took 171.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,070 INFO L168 Benchmark]: BuchiAutomizer took 525235.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 659.7 MB in the end (delta: 413.2 MB). Peak memory consumption was 531.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:38:46,071 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 525235.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 659.7 MB in the end (delta: 413.2 MB). Peak memory consumption was 531.2 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 * 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...