./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:31:10,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:31:10,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:31:10,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:31:10,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:31:10,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:31:10,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:31:10,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:31:10,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:31:10,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:31:10,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:31:10,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:31:10,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:31:10,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:31:10,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:31:10,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:31:10,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:31:10,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:31:10,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:31:10,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:31:10,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:31:10,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:31:10,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:31:10,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:31:10,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:31:10,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:31:10,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:31:10,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:31:10,922 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:31:10,923 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:31:10,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:31:10,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:31:10,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:31:10,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:31:10,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:31:10,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:31:10,925 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:31:10,935 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:31:10,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:31:10,936 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:31:10,937 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:31:10,937 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:31:10,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:31:10,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:31:10,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:31:10,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:31:10,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:31:10,940 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:31:10,940 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:31:10,940 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_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 [2018-11-23 06:31:10,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:31:10,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:31:10,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:31:10,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:31:10,972 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:31:10,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-23 06:31:11,007 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/data/dc62c4906/2a5dce099b694053b6af7ce5a7193fc0/FLAGfed840a80 [2018-11-23 06:31:11,304 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:31:11,304 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-23 06:31:11,308 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/data/dc62c4906/2a5dce099b694053b6af7ce5a7193fc0/FLAGfed840a80 [2018-11-23 06:31:11,318 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/data/dc62c4906/2a5dce099b694053b6af7ce5a7193fc0 [2018-11-23 06:31:11,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:31:11,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:31:11,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:31:11,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:31:11,324 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:31:11,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e873bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11, skipping insertion in model container [2018-11-23 06:31:11,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:31:11,345 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:31:11,447 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:31:11,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:31:11,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:31:11,474 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:31:11,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11 WrapperNode [2018-11-23 06:31:11,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:31:11,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:31:11,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:31:11,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:31:11,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:31:11,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:31:11,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:31:11,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:31:11,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... [2018-11-23 06:31:11,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:31:11,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:31:11,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:31:11,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:31:11,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:31:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-11-23 06:31:11,610 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-11-23 06:31:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:31:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:31:11,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:31:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:31:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:31:11,851 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:31:11,851 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 06:31:11,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:31:11 BoogieIcfgContainer [2018-11-23 06:31:11,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:31:11,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:31:11,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:31:11,855 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:31:11,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:31:11,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:31:11" (1/3) ... [2018-11-23 06:31:11,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bfa60d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:31:11, skipping insertion in model container [2018-11-23 06:31:11,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:31:11,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:11" (2/3) ... [2018-11-23 06:31:11,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bfa60d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:31:11, skipping insertion in model container [2018-11-23 06:31:11,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:31:11,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:31:11" (3/3) ... [2018-11-23 06:31:11,859 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-11-23 06:31:11,902 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:31:11,903 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:31:11,903 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:31:11,903 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:31:11,903 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:31:11,903 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:31:11,903 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:31:11,904 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:31:11,904 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:31:11,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-23 06:31:11,930 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 06:31:11,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:11,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:11,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:31:11,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:31:11,934 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:31:11,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-23 06:31:11,936 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 06:31:11,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:11,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:11,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:31:11,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:31:11,942 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2018-11-23 06:31:11,942 INFO L796 eck$LassoCheckResult]: Loop: 4#L40-3true assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4#L40-3true [2018-11-23 06:31:11,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2018-11-23 06:31:11,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:11,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-11-23 06:31:12,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2018-11-23 06:31:12,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,180 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:12,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:12,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:12,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:12,181 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:12,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:12,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:12,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:12,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-11-23 06:31:12,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:12,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:12,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:12,437 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:12,440 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:12,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:12,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:12,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:12,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:12,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:12,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:12,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:12,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:12,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:12,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:12,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:12,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:12,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:12,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:12,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:12,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:12,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:12,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:12,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:12,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,473 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:31:12,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:31:12,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:12,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:12,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:12,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:12,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:12,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:12,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:12,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:12,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:12,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:12,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:12,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:12,558 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:31:12,558 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:31:12,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:12,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:31:12,561 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:12,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1) = -4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 Supporting invariants [] [2018-11-23 06:31:12,583 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:31:12,589 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:31:12,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:12,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:12,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:12,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:31:12,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2018-11-23 06:31:12,686 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2018-11-23 06:31:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:31:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 06:31:12,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 06:31:12,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:12,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 06:31:12,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:12,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 06:31:12,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:12,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-11-23 06:31:12,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:12,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2018-11-23 06:31:12,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 06:31:12,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 06:31:12,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-11-23 06:31:12,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:31:12,701 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-23 06:31:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-11-23 06:31:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 06:31:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 06:31:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-11-23 06:31:12,720 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-23 06:31:12,720 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-23 06:31:12,720 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:31:12,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2018-11-23 06:31:12,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:12,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:12,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:12,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:31:12,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:31:12,722 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 160#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 150#L40-3 assume !(main_~i~1 < main_~n~0); 146#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 164#merge_sortENTRY [2018-11-23 06:31:12,722 INFO L796 eck$LassoCheckResult]: Loop: 164#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 153#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 147#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 164#merge_sortENTRY [2018-11-23 06:31:12,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2018-11-23 06:31:12,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:12,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:31:12,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:31:12,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:12,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-11-23 06:31:12,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:31:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:31:12,905 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-23 06:31:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:12,916 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-11-23 06:31:12,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:31:12,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-23 06:31:12,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:12,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 06:31:12,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 06:31:12,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 06:31:12,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 06:31:12,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:31:12,919 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 06:31:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 06:31:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 06:31:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 06:31:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-23 06:31:12,921 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-23 06:31:12,921 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-23 06:31:12,921 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:31:12,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-11-23 06:31:12,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:12,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:12,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:12,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:12,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:31:12,923 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 219#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 209#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 210#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 211#L40-3 assume !(main_~i~1 < main_~n~0); 206#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 223#merge_sortENTRY [2018-11-23 06:31:12,923 INFO L796 eck$LassoCheckResult]: Loop: 223#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 212#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 204#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 223#merge_sortENTRY [2018-11-23 06:31:12,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2018-11-23 06:31:12,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2018-11-23 06:31:12,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:12,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2018-11-23 06:31:12,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:12,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:13,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:13,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:13,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:13,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:13,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 06:31:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:31:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:31:13,181 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-23 06:31:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:13,217 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 06:31:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:31:13,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-23 06:31:13,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:13,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2018-11-23 06:31:13,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 06:31:13,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 06:31:13,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-23 06:31:13,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:31:13,225 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-23 06:31:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-23 06:31:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 06:31:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 06:31:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 06:31:13,227 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 06:31:13,227 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 06:31:13,227 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:31:13,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 06:31:13,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:13,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:13,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:13,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 06:31:13,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:31:13,228 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 325#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 326#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 315#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 316#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 317#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 318#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 336#L40-3 assume !(main_~i~1 < main_~n~0); 311#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 330#merge_sortENTRY [2018-11-23 06:31:13,228 INFO L796 eck$LassoCheckResult]: Loop: 330#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 319#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 310#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 330#merge_sortENTRY [2018-11-23 06:31:13,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2018-11-23 06:31:13,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:13,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2018-11-23 06:31:13,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2018-11-23 06:31:13,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:13,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:13,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:13,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:13,586 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:13,586 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:13,586 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:13,586 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:13,586 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:13,586 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:13,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:13,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:13,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-11-23 06:31:13,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:13,587 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:13,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,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-11-23 06:31:13,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,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-11-23 06:31:13,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-11-23 06:31:13,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-11-23 06:31:13,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:13,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:13,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:13,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:13,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:13,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:13,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:13,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,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-11-23 06:31:13,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:13,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:13,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:13,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,968 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:31:13,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,969 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:31:13,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:13,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:13,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:13,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:13,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:13,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:13,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:13,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:13,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:13,989 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:14,013 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:31:14,013 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:31:14,013 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:14,014 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:31:14,014 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:14,014 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-11-23 06:31:14,028 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 06:31:14,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:14,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:14,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:14,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 06:31:14,132 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 06:31:14,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-11-23 06:31:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:31:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 06:31:14,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 06:31:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:14,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 06:31:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:14,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 06:31:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:14,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-23 06:31:14,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:14,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2018-11-23 06:31:14,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 06:31:14,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 06:31:14,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-11-23 06:31:14,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:14,202 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-11-23 06:31:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-11-23 06:31:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 06:31:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:31:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-23 06:31:14,204 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 06:31:14,205 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 06:31:14,205 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:31:14,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-23 06:31:14,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:31:14,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:14,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:14,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:14,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:14,207 INFO L794 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 475#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 462#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 463#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 464#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 465#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 489#L40-3 assume !(main_~i~1 < main_~n~0); 459#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 479#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 468#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 458#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 485#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 466#L24 assume ~n < 2; 467#L8 assume true; 476#merge_sortEXIT >#86#return; 457#L27-1 [2018-11-23 06:31:14,207 INFO L796 eck$LassoCheckResult]: Loop: 457#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 486#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 488#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 456#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 486#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 488#L24 assume ~n < 2; 472#L8 assume true; 487#merge_sortEXIT >#86#return; 457#L27-1 [2018-11-23 06:31:14,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2018-11-23 06:31:14,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2018-11-23 06:31:14,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2018-11-23 06:31:14,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:31:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:14,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:14,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:14,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:14,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 06:31:14,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:31:14,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:31:14,592 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-23 06:31:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:14,688 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 06:31:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:31:14,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-23 06:31:14,689 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-23 06:31:14,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2018-11-23 06:31:14,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 06:31:14,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-23 06:31:14,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-11-23 06:31:14,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:14,691 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-23 06:31:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-11-23 06:31:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 06:31:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 06:31:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-11-23 06:31:14,695 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-23 06:31:14,695 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-23 06:31:14,695 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:31:14,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2018-11-23 06:31:14,696 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-23 06:31:14,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:14,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:14,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:14,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:14,697 INFO L794 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 675#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 676#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 658#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 659#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 660#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 661#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 705#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 702#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 701#L40-3 assume !(main_~i~1 < main_~n~0); 665#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 696#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 664#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 666#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 692#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 693#L24 assume ~n < 2; 718#L8 assume true; 714#merge_sortEXIT >#86#return; 668#L27-1 [2018-11-23 06:31:14,697 INFO L796 eck$LassoCheckResult]: Loop: 668#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 694#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 716#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 669#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 694#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 716#L24 assume ~n < 2; 717#L8 assume true; 713#merge_sortEXIT >#86#return; 668#L27-1 [2018-11-23 06:31:14,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2018-11-23 06:31:14,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2018-11-23 06:31:14,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2018-11-23 06:31:14,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:14,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:15,144 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-11-23 06:31:15,312 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-23 06:31:15,340 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:15,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:15,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:15,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:15,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:15,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:15,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:15,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:15,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration6_Lasso [2018-11-23 06:31:15,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:15,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:15,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:15,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:15,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:15,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:15,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:15,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:15,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:15,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:15,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:15,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:15,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,714 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:31:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:31:15,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:15,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:15,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:15,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:15,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:15,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:15,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:15,743 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:15,762 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:31:15,762 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-23 06:31:15,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:15,763 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:31:15,764 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:15,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n, merge_sort_~m~0) = 1*merge_sort_~n - 1*merge_sort_~m~0 Supporting invariants [] [2018-11-23 06:31:15,764 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:31:15,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:15,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:15,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:15,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 06:31:15,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-23 06:31:16,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 310 states and 425 transitions. Complement of second has 28 states. [2018-11-23 06:31:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 06:31:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-11-23 06:31:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-23 06:31:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-23 06:31:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-23 06:31:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:16,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 425 transitions. [2018-11-23 06:31:16,047 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2018-11-23 06:31:16,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 227 states and 317 transitions. [2018-11-23 06:31:16,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-11-23 06:31:16,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-11-23 06:31:16,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 317 transitions. [2018-11-23 06:31:16,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:16,051 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 317 transitions. [2018-11-23 06:31:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 317 transitions. [2018-11-23 06:31:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2018-11-23 06:31:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-23 06:31:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2018-11-23 06:31:16,065 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-11-23 06:31:16,065 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-11-23 06:31:16,065 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:31:16,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 282 transitions. [2018-11-23 06:31:16,067 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2018-11-23 06:31:16,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:16,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:16,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:16,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:31:16,068 INFO L794 eck$LassoCheckResult]: Stem: 1213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1196#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1197#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1171#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1172#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1173#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1174#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1175#L40-3 assume !(main_~i~1 < main_~n~0); 1163#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1204#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1261#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1223#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1224#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1343#L24 assume ~n < 2; 1342#L8 assume true; 1337#merge_sortEXIT >#86#return; 1177#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1218#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1176#L24 assume ~n < 2; 1178#L8 assume true; 1198#merge_sortEXIT >#88#return; 1200#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1201#L11-3 [2018-11-23 06:31:16,068 INFO L796 eck$LassoCheckResult]: Loop: 1201#L11-3 assume !!(merge_~k~0 < merge_~n); 1207#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 1194#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 1209#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1201#L11-3 [2018-11-23 06:31:16,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2018-11-23 06:31:16,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2018-11-23 06:31:16,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:16,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2018-11-23 06:31:16,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:31:16,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:31:16,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:31:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:31:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:31:16,174 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. cyclomatic complexity: 100 Second operand 4 states. [2018-11-23 06:31:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:16,205 INFO L93 Difference]: Finished difference Result 319 states and 436 transitions. [2018-11-23 06:31:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:31:16,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 436 transitions. [2018-11-23 06:31:16,210 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2018-11-23 06:31:16,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 436 transitions. [2018-11-23 06:31:16,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2018-11-23 06:31:16,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2018-11-23 06:31:16,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 436 transitions. [2018-11-23 06:31:16,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:16,216 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 436 transitions. [2018-11-23 06:31:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 436 transitions. [2018-11-23 06:31:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 260. [2018-11-23 06:31:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 06:31:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2018-11-23 06:31:16,229 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-11-23 06:31:16,229 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-11-23 06:31:16,230 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:31:16,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 345 transitions. [2018-11-23 06:31:16,231 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-11-23 06:31:16,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:16,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:16,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:16,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:16,232 INFO L794 eck$LassoCheckResult]: Stem: 1768#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1740#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1741#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1708#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1709#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1710#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1711#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1788#L40-3 assume !(main_~i~1 < main_~n~0); 1700#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1751#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1817#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1779#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1834#L24 assume ~n < 2; 1833#L8 assume true; 1832#merge_sortEXIT >#86#return; 1763#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1781#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1898#L24 assume ~n < 2; 1882#L8 assume true; 1762#merge_sortEXIT >#88#return; 1764#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1931#L11-3 [2018-11-23 06:31:16,232 INFO L796 eck$LassoCheckResult]: Loop: 1931#L11-3 assume !!(merge_~k~0 < merge_~n); 1932#L12 assume !(merge_~j~0 == merge_~n); 1950#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 1955#L14 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post11;call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post11, 4);merge_#t~ite13 := merge_#t~mem12; 1954#L14-2 merge_#t~ite14 := merge_#t~ite13; 1953#L13-2 merge_#t~ite15 := merge_#t~ite14; 1952#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 1951#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1931#L11-3 [2018-11-23 06:31:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,233 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2018-11-23 06:31:16,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2018-11-23 06:31:16,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2018-11-23 06:31:16,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:16,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:16,620 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2018-11-23 06:31:17,031 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-11-23 06:31:17,090 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:17,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:17,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:17,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:17,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:17,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:17,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:17,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:17,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration8_Lasso [2018-11-23 06:31:17,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:17,090 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:17,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,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-11-23 06:31:17,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-11-23 06:31:17,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-11-23 06:31:17,287 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-11-23 06:31:17,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:17,538 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-11-23 06:31:17,825 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 06:31:17,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:17,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:17,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-11-23 06:31:17,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:17,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:17,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:17,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:17,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:17,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:17,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-11-23 06:31:17,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:17,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:17,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:17,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:17,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:17,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:17,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-11-23 06:31:17,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:17,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:17,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:17,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:17,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:17,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:17,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-11-23 06:31:17,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,898 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:31:17,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:17,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:31:17,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:17,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:17,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-11-23 06:31:17,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:17,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:17,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:17,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:17,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:17,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-11-23 06:31:17,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:17,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:17,906 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 06:31:17,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:17,939 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-23 06:31:17,939 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 06:31:19,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:19,689 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-23 06:31:19,689 INFO L444 ModelExtractionUtils]: 194 out of 208 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-11-23 06:31:19,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:19,691 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-23 06:31:19,692 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:19,692 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~i~0, v_rep(select #length merge_sort_merge_~a.base)_1) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 + 1*v_rep(select #length merge_sort_merge_~a.base)_1 Supporting invariants [] [2018-11-23 06:31:19,723 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 06:31:19,724 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:31:19,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:19,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:19,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:19,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 06:31:19,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109 Second operand 6 states. [2018-11-23 06:31:19,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109. Second operand 6 states. Result 648 states and 877 transitions. Complement of second has 14 states. [2018-11-23 06:31:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 06:31:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 06:31:19,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-23 06:31:19,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:19,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-23 06:31:19,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:19,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 16 letters. [2018-11-23 06:31:19,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:19,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 877 transitions. [2018-11-23 06:31:19,878 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 180 [2018-11-23 06:31:19,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 632 states and 845 transitions. [2018-11-23 06:31:19,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2018-11-23 06:31:19,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2018-11-23 06:31:19,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 845 transitions. [2018-11-23 06:31:19,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:19,886 INFO L705 BuchiCegarLoop]: Abstraction has 632 states and 845 transitions. [2018-11-23 06:31:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 845 transitions. [2018-11-23 06:31:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 464. [2018-11-23 06:31:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-11-23 06:31:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 637 transitions. [2018-11-23 06:31:19,902 INFO L728 BuchiCegarLoop]: Abstraction has 464 states and 637 transitions. [2018-11-23 06:31:19,903 INFO L608 BuchiCegarLoop]: Abstraction has 464 states and 637 transitions. [2018-11-23 06:31:19,903 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:31:19,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 637 transitions. [2018-11-23 06:31:19,905 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 144 [2018-11-23 06:31:19,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:19,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:19,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:19,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:31:19,906 INFO L794 eck$LassoCheckResult]: Stem: 2858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2828#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 2829#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2786#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2787#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2788#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2789#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2790#L40-3 assume !(main_~i~1 < main_~n~0); 2777#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2839#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2913#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 2910#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 2909#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2911#L24 assume ~n < 2; 2917#L8 assume true; 2914#merge_sortEXIT >#86#return; 2915#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 2996#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2998#L24 assume ~n < 2; 2997#L8 assume true; 2995#merge_sortEXIT >#88#return; 2986#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 2994#L11-3 assume !!(merge_~k~0 < merge_~n); 2980#L12 [2018-11-23 06:31:19,906 INFO L796 eck$LassoCheckResult]: Loop: 2980#L12 assume !(merge_~j~0 == merge_~n); 3017#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post5;call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post5, 4);merge_#t~ite14 := merge_#t~mem6; 3015#L13-2 merge_#t~ite15 := merge_#t~ite14; 2999#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 2993#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 2979#L11-3 assume !!(merge_~k~0 < merge_~n); 2980#L12 [2018-11-23 06:31:19,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2018-11-23 06:31:19,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:19,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times [2018-11-23 06:31:19,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:19,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash 426493234, now seen corresponding path program 1 times [2018-11-23 06:31:19,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:19,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:31:19,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:31:19,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:31:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:31:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:31:20,028 INFO L87 Difference]: Start difference. First operand 464 states and 637 transitions. cyclomatic complexity: 214 Second operand 4 states. [2018-11-23 06:31:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:20,054 INFO L93 Difference]: Finished difference Result 641 states and 857 transitions. [2018-11-23 06:31:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:31:20,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 857 transitions. [2018-11-23 06:31:20,059 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 210 [2018-11-23 06:31:20,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 641 states and 857 transitions. [2018-11-23 06:31:20,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2018-11-23 06:31:20,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2018-11-23 06:31:20,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 857 transitions. [2018-11-23 06:31:20,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:20,064 INFO L705 BuchiCegarLoop]: Abstraction has 641 states and 857 transitions. [2018-11-23 06:31:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 857 transitions. [2018-11-23 06:31:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 632. [2018-11-23 06:31:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-23 06:31:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 848 transitions. [2018-11-23 06:31:20,078 INFO L728 BuchiCegarLoop]: Abstraction has 632 states and 848 transitions. [2018-11-23 06:31:20,078 INFO L608 BuchiCegarLoop]: Abstraction has 632 states and 848 transitions. [2018-11-23 06:31:20,078 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 06:31:20,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 632 states and 848 transitions. [2018-11-23 06:31:20,083 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 210 [2018-11-23 06:31:20,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:20,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:20,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:20,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:20,084 INFO L794 eck$LassoCheckResult]: Stem: 3970#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3936#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 3937#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 3902#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3903#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3904#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3905#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3906#L40-3 assume !(main_~i~1 < main_~n~0); 3893#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3952#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4040#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4035#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4036#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4041#L24 assume ~n < 2; 4039#L8 assume true; 4034#merge_sortEXIT >#86#return; 4030#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4031#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4038#L24 assume ~n < 2; 4033#L8 assume true; 4029#merge_sortEXIT >#88#return; 4025#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 4026#L11-3 assume !!(merge_~k~0 < merge_~n); 4023#L12 [2018-11-23 06:31:20,084 INFO L796 eck$LassoCheckResult]: Loop: 4023#L12 assume !(merge_~j~0 == merge_~n); 4063#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 4059#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 4057#L14-2 merge_#t~ite14 := merge_#t~ite13; 4050#L13-2 merge_#t~ite15 := merge_#t~ite14; 4051#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 4024#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 4022#L11-3 assume !!(merge_~k~0 < merge_~n); 4023#L12 [2018-11-23 06:31:20,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2018-11-23 06:31:20,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:20,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2018-11-23 06:31:20,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -857421960, now seen corresponding path program 1 times [2018-11-23 06:31:20,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:20,233 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-23 06:31:20,483 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-23 06:31:20,889 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 114 [2018-11-23 06:31:20,958 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:20,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:20,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:20,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:20,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:20,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:20,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:20,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:20,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration10_Lasso [2018-11-23 06:31:20,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:20,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:20,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:20,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:20,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:20,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:20,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:20,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-11-23 06:31:20,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-11-23 06:31:21,202 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2018-11-23 06:31:21,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,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-11-23 06:31:21,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,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-11-23 06:31:21,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-11-23 06:31:21,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,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-11-23 06:31:21,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-11-23 06:31:21,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-11-23 06:31:21,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-11-23 06:31:21,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-11-23 06:31:21,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:21,398 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2018-11-23 06:31:21,647 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 06:31:21,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:21,722 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:21,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:21,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:21,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:21,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:21,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:21,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:21,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:21,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:21,728 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 06:31:21,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:21,757 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-23 06:31:21,757 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 06:31:22,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:23,070 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-23 06:31:23,070 INFO L444 ModelExtractionUtils]: 193 out of 208 variables were initially zero. Simplification set additionally 11 variables to zero. [2018-11-23 06:31:23,071 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:23,072 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-23 06:31:23,072 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:23,072 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~j~0, v_rep(select #length merge_sort_merge_~a.base)_2) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~j~0 + 1*v_rep(select #length merge_sort_merge_~a.base)_2 Supporting invariants [] [2018-11-23 06:31:23,116 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 06:31:23,117 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:31:23,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:23,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:23,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:23,225 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 06:31:23,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 632 states and 848 transitions. cyclomatic complexity: 265 Second operand 6 states. [2018-11-23 06:31:23,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 632 states and 848 transitions. cyclomatic complexity: 265. Second operand 6 states. Result 1685 states and 2296 transitions. Complement of second has 14 states. [2018-11-23 06:31:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 06:31:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 06:31:23,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-23 06:31:23,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:23,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-23 06:31:23,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:23,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 23 letters. Loop has 16 letters. [2018-11-23 06:31:23,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:23,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1685 states and 2296 transitions. [2018-11-23 06:31:23,346 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 250 [2018-11-23 06:31:23,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1685 states to 1500 states and 2039 transitions. [2018-11-23 06:31:23,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 576 [2018-11-23 06:31:23,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 606 [2018-11-23 06:31:23,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1500 states and 2039 transitions. [2018-11-23 06:31:23,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:23,355 INFO L705 BuchiCegarLoop]: Abstraction has 1500 states and 2039 transitions. [2018-11-23 06:31:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states and 2039 transitions. [2018-11-23 06:31:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1209. [2018-11-23 06:31:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2018-11-23 06:31:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1661 transitions. [2018-11-23 06:31:23,377 INFO L728 BuchiCegarLoop]: Abstraction has 1209 states and 1661 transitions. [2018-11-23 06:31:23,377 INFO L608 BuchiCegarLoop]: Abstraction has 1209 states and 1661 transitions. [2018-11-23 06:31:23,377 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 06:31:23,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1209 states and 1661 transitions. [2018-11-23 06:31:23,382 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 226 [2018-11-23 06:31:23,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:23,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:23,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:23,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:31:23,383 INFO L794 eck$LassoCheckResult]: Stem: 6467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6424#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 6425#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6391#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6392#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6393#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6394#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6518#L40-3 assume !(main_~i~1 < main_~n~0); 6382#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6444#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6526#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6523#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6524#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6532#L24 assume ~n < 2; 6531#L8 assume true; 6530#merge_sortEXIT >#86#return; 6461#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6848#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6724#L24 assume ~n < 2; 6725#L8 assume true; 6460#merge_sortEXIT >#88#return; 6428#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6429#L11-3 assume !(merge_~k~0 < merge_~n); 6468#L11-4 merge_~i~0 := 0; 6381#L17-3 [2018-11-23 06:31:23,383 INFO L796 eck$LassoCheckResult]: Loop: 6381#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 6384#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 6381#L17-3 [2018-11-23 06:31:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2018-11-23 06:31:23,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:31:23,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:31:23,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:31:23,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:23,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2018-11-23 06:31:23,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:23,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:31:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:31:23,451 INFO L87 Difference]: Start difference. First operand 1209 states and 1661 transitions. cyclomatic complexity: 559 Second operand 4 states. [2018-11-23 06:31:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:23,475 INFO L93 Difference]: Finished difference Result 1146 states and 1455 transitions. [2018-11-23 06:31:23,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:31:23,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1146 states and 1455 transitions. [2018-11-23 06:31:23,484 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 132 [2018-11-23 06:31:23,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1146 states to 1146 states and 1455 transitions. [2018-11-23 06:31:23,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2018-11-23 06:31:23,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2018-11-23 06:31:23,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1146 states and 1455 transitions. [2018-11-23 06:31:23,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:23,492 INFO L705 BuchiCegarLoop]: Abstraction has 1146 states and 1455 transitions. [2018-11-23 06:31:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states and 1455 transitions. [2018-11-23 06:31:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 826. [2018-11-23 06:31:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2018-11-23 06:31:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1088 transitions. [2018-11-23 06:31:23,511 INFO L728 BuchiCegarLoop]: Abstraction has 826 states and 1088 transitions. [2018-11-23 06:31:23,511 INFO L608 BuchiCegarLoop]: Abstraction has 826 states and 1088 transitions. [2018-11-23 06:31:23,511 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 06:31:23,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 826 states and 1088 transitions. [2018-11-23 06:31:23,514 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 132 [2018-11-23 06:31:23,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:23,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:23,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:23,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:31:23,515 INFO L794 eck$LassoCheckResult]: Stem: 8820#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8787#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 8788#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8755#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8756#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8757#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8758#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8884#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8759#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8760#L40-3 assume !(main_~i~1 < main_~n~0); 8747#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8883#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8765#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8766#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8839#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8861#L24 assume ~n < 2; 8860#L8 assume true; 8859#merge_sortEXIT >#86#return; 8772#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8858#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9244#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8750#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8853#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8854#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8828#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8825#merge_sortENTRY [2018-11-23 06:31:23,515 INFO L796 eck$LassoCheckResult]: Loop: 8825#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8830#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8826#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8825#merge_sortENTRY [2018-11-23 06:31:23,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2018-11-23 06:31:23,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:23,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 06:31:23,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:23,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:23,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:31:23,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 06:31:23,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:31:23,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:23,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:23,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-11-23 06:31:23,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:23,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2018-11-23 06:31:23,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:23,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:23,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:23,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 06:31:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-23 06:31:23,814 INFO L87 Difference]: Start difference. First operand 826 states and 1088 transitions. cyclomatic complexity: 332 Second operand 18 states. [2018-11-23 06:31:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:24,093 INFO L93 Difference]: Finished difference Result 481 states and 619 transitions. [2018-11-23 06:31:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 06:31:24,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 619 transitions. [2018-11-23 06:31:24,097 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 122 [2018-11-23 06:31:24,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 473 states and 611 transitions. [2018-11-23 06:31:24,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-23 06:31:24,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2018-11-23 06:31:24,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 473 states and 611 transitions. [2018-11-23 06:31:24,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:24,100 INFO L705 BuchiCegarLoop]: Abstraction has 473 states and 611 transitions. [2018-11-23 06:31:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states and 611 transitions. [2018-11-23 06:31:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 321. [2018-11-23 06:31:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-23 06:31:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 407 transitions. [2018-11-23 06:31:24,110 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 407 transitions. [2018-11-23 06:31:24,110 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 407 transitions. [2018-11-23 06:31:24,110 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 06:31:24,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 407 transitions. [2018-11-23 06:31:24,111 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-23 06:31:24,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:24,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:24,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:24,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:31:24,112 INFO L794 eck$LassoCheckResult]: Stem: 10227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10203#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 10204#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 10177#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10178#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10179#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10180#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10245#L40-3 assume !(main_~i~1 < main_~n~0); 10173#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 10211#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10270#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10259#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10271#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10269#L24 assume ~n < 2; 10258#L8 assume true; 10260#merge_sortEXIT >#86#return; 10234#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10233#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10235#L24 assume ~n < 2; 10400#L8 assume true; 10399#merge_sortEXIT >#88#return; 10327#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10396#L11-3 assume !!(merge_~k~0 < merge_~n); 10391#L12 assume !(merge_~j~0 == merge_~n); 10389#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 10365#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 10387#L14-2 merge_#t~ite14 := merge_#t~ite13; 10361#L13-2 merge_#t~ite15 := merge_#t~ite14; 10356#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 10355#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10354#L11-3 assume !(merge_~k~0 < merge_~n); 10351#L11-4 merge_~i~0 := 0; 10172#L17-3 [2018-11-23 06:31:24,112 INFO L796 eck$LassoCheckResult]: Loop: 10172#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 10175#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 10172#L17-3 [2018-11-23 06:31:24,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2018-11-23 06:31:24,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:24,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:31:24,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:24,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:24,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:31:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 06:31:24,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:24,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2018-11-23 06:31:24,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:31:24,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:31:24,267 INFO L87 Difference]: Start difference. First operand 321 states and 407 transitions. cyclomatic complexity: 111 Second operand 7 states. [2018-11-23 06:31:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:24,313 INFO L93 Difference]: Finished difference Result 629 states and 774 transitions. [2018-11-23 06:31:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:31:24,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 629 states and 774 transitions. [2018-11-23 06:31:24,319 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-23 06:31:24,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 629 states to 617 states and 759 transitions. [2018-11-23 06:31:24,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2018-11-23 06:31:24,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2018-11-23 06:31:24,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 617 states and 759 transitions. [2018-11-23 06:31:24,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:24,323 INFO L705 BuchiCegarLoop]: Abstraction has 617 states and 759 transitions. [2018-11-23 06:31:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states and 759 transitions. [2018-11-23 06:31:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 363. [2018-11-23 06:31:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 06:31:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 451 transitions. [2018-11-23 06:31:24,331 INFO L728 BuchiCegarLoop]: Abstraction has 363 states and 451 transitions. [2018-11-23 06:31:24,331 INFO L608 BuchiCegarLoop]: Abstraction has 363 states and 451 transitions. [2018-11-23 06:31:24,331 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 06:31:24,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 451 transitions. [2018-11-23 06:31:24,333 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-23 06:31:24,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:24,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:24,334 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:24,334 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:31:24,334 INFO L794 eck$LassoCheckResult]: Stem: 11285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11262#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 11263#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11236#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11237#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11238#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11239#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11240#L40-3 assume !(main_~i~1 < main_~n~0); 11232#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11373#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11371#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11365#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11368#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11379#L24 assume ~n < 2; 11378#L8 assume true; 11364#merge_sortEXIT >#86#return; 11362#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11363#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11382#L24 assume ~n < 2; 11374#L8 assume true; 11375#merge_sortEXIT >#88#return; 11359#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 11357#L11-3 assume !!(merge_~k~0 < merge_~n); 11358#L12 assume !(merge_~j~0 == merge_~n); 11330#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 11338#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 11339#L14-2 merge_#t~ite14 := merge_#t~ite13; 11333#L13-2 merge_#t~ite15 := merge_#t~ite14; 11331#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 11311#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11318#L11-3 assume !!(merge_~k~0 < merge_~n); 11313#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 11310#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 11309#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11308#L11-3 assume !(merge_~k~0 < merge_~n); 11307#L11-4 merge_~i~0 := 0; 11231#L17-3 [2018-11-23 06:31:24,334 INFO L796 eck$LassoCheckResult]: Loop: 11231#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 11235#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 11231#L17-3 [2018-11-23 06:31:24,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2018-11-23 06:31:24,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:24,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:24,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2018-11-23 06:31:24,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:24,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:24,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2018-11-23 06:31:24,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:25,177 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 195 [2018-11-23 06:31:25,433 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2018-11-23 06:31:25,953 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 135 [2018-11-23 06:31:26,054 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:26,054 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:26,054 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:26,054 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:26,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:26,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:26,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:26,055 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:26,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration14_Lasso [2018-11-23 06:31:26,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:26,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:26,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,333 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 117 [2018-11-23 06:31:26,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:26,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:31:26,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:31:26,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:26,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:26,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,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-11-23 06:31:26,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:31:26,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:31:26,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:31:26,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:26,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,757 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:31:26,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,758 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:31:26,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,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-11-23 06:31:26,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:26,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:31:26,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:31:26,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:31:26,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:31:26,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:31:26,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:31:26,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:31:26,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:31:26,782 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:31:26,803 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 06:31:26,803 INFO L444 ModelExtractionUtils]: 55 out of 64 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 06:31:26,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:31:26,804 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:31:26,804 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:31:26,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0, merge_sort_merge_~n) = -1*merge_sort_merge_~i~0 + 1*merge_sort_merge_~n Supporting invariants [] [2018-11-23 06:31:26,958 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 06:31:26,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:27,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:27,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:31:27,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:31:27,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 451 transitions. cyclomatic complexity: 113 Second operand 4 states. [2018-11-23 06:31:27,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 451 transitions. cyclomatic complexity: 113. Second operand 4 states. Result 375 states and 470 transitions. Complement of second has 12 states. [2018-11-23 06:31:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:31:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:31:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 06:31:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2018-11-23 06:31:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-23 06:31:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-23 06:31:27,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:31:27,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 470 transitions. [2018-11-23 06:31:27,085 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-23 06:31:27,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 284 states and 355 transitions. [2018-11-23 06:31:27,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-23 06:31:27,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-23 06:31:27,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 355 transitions. [2018-11-23 06:31:27,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:27,087 INFO L705 BuchiCegarLoop]: Abstraction has 284 states and 355 transitions. [2018-11-23 06:31:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 355 transitions. [2018-11-23 06:31:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-11-23 06:31:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 06:31:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 355 transitions. [2018-11-23 06:31:27,091 INFO L728 BuchiCegarLoop]: Abstraction has 284 states and 355 transitions. [2018-11-23 06:31:27,091 INFO L608 BuchiCegarLoop]: Abstraction has 284 states and 355 transitions. [2018-11-23 06:31:27,091 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 06:31:27,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 355 transitions. [2018-11-23 06:31:27,092 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-23 06:31:27,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:27,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:27,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:27,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:27,094 INFO L794 eck$LassoCheckResult]: Stem: 12232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12205#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 12206#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 12180#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 12181#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 12182#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 12183#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 12249#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 12184#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 12185#L40-3 assume !(main_~i~1 < main_~n~0); 12197#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 12217#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12345#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 12341#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 12344#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12241#L24 assume ~n < 2; 12343#L8 assume true; 12340#merge_sortEXIT >#86#return; 12215#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 12336#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12397#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 12394#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 12395#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12398#L24 assume ~n < 2; 12396#L8 assume true; 12393#merge_sortEXIT >#86#return; 12243#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 12244#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12342#L24 assume ~n < 2; 12339#L8 assume true; 12337#merge_sortEXIT >#88#return; 12308#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 12305#L11-3 assume !!(merge_~k~0 < merge_~n); 12301#L12 assume !(merge_~j~0 == merge_~n); 12290#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 12298#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 12322#L14-2 merge_#t~ite14 := merge_#t~ite13; 12281#L13-2 merge_#t~ite15 := merge_#t~ite14; 12278#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 12275#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12270#L11-3 assume !!(merge_~k~0 < merge_~n); 12261#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 12262#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 12252#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12253#L11-3 assume !(merge_~k~0 < merge_~n); 12235#L11-4 merge_~i~0 := 0; 12236#L17-3 assume !(merge_~i~0 < merge_~n); 12348#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 12347#L8 assume true; 12346#merge_sortEXIT >#88#return; 12335#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 12433#L11-3 assume !!(merge_~k~0 < merge_~n); 12432#L12 assume !(merge_~j~0 == merge_~n); 12431#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 12428#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 12425#L14-2 merge_#t~ite14 := merge_#t~ite13; 12423#L13-2 merge_#t~ite15 := merge_#t~ite14; 12421#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 12419#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12417#L11-3 assume !!(merge_~k~0 < merge_~n); 12416#L12 [2018-11-23 06:31:27,094 INFO L796 eck$LassoCheckResult]: Loop: 12416#L12 assume !(merge_~j~0 == merge_~n); 12430#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 12426#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 12427#L14-2 merge_#t~ite14 := merge_#t~ite13; 12414#L13-2 merge_#t~ite15 := merge_#t~ite14; 12415#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 12407#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12408#L11-3 assume !!(merge_~k~0 < merge_~n); 12416#L12 [2018-11-23 06:31:27,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2018-11-23 06:31:27,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:27,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 06:31:27,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:27,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:27,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:27,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 06:31:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:27,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-11-23 06:31:27,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2018-11-23 06:31:27,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:27,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:27,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:27,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:27,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 06:31:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:31:27,451 INFO L87 Difference]: Start difference. First operand 284 states and 355 transitions. cyclomatic complexity: 90 Second operand 20 states. [2018-11-23 06:31:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:28,018 INFO L93 Difference]: Finished difference Result 525 states and 640 transitions. [2018-11-23 06:31:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 06:31:28,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 640 transitions. [2018-11-23 06:31:28,023 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 124 [2018-11-23 06:31:28,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 519 states and 634 transitions. [2018-11-23 06:31:28,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2018-11-23 06:31:28,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2018-11-23 06:31:28,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 519 states and 634 transitions. [2018-11-23 06:31:28,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:28,025 INFO L705 BuchiCegarLoop]: Abstraction has 519 states and 634 transitions. [2018-11-23 06:31:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states and 634 transitions. [2018-11-23 06:31:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 325. [2018-11-23 06:31:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-23 06:31:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 404 transitions. [2018-11-23 06:31:28,032 INFO L728 BuchiCegarLoop]: Abstraction has 325 states and 404 transitions. [2018-11-23 06:31:28,032 INFO L608 BuchiCegarLoop]: Abstraction has 325 states and 404 transitions. [2018-11-23 06:31:28,032 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 06:31:28,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 404 transitions. [2018-11-23 06:31:28,033 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-11-23 06:31:28,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:28,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:28,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:28,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:28,034 INFO L794 eck$LassoCheckResult]: Stem: 13273#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13249#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 13250#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 13230#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13231#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13289#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13290#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13232#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13233#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13234#L40-3 assume !(main_~i~1 < main_~n~0); 13223#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 13258#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13324#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13285#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13286#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13284#L24 assume ~n < 2; 13354#L8 assume true; 13353#merge_sortEXIT >#86#return; 13227#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13317#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13337#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13320#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13321#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13336#L24 assume ~n < 2; 13335#L8 assume true; 13319#merge_sortEXIT >#86#return; 13281#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13280#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13282#L24 assume ~n < 2; 13416#L8 assume true; 13415#merge_sortEXIT >#88#return; 13414#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 13412#L11-3 assume !!(merge_~k~0 < merge_~n); 13411#L12 assume !(merge_~j~0 == merge_~n); 13386#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 13394#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 13395#L14-2 merge_#t~ite14 := merge_#t~ite13; 13418#L13-2 merge_#t~ite15 := merge_#t~ite14; 13397#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 13347#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13350#L11-3 assume !!(merge_~k~0 < merge_~n); 13348#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 13346#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 13314#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13315#L11-3 assume !(merge_~k~0 < merge_~n); 13297#L11-4 merge_~i~0 := 0; 13298#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 13229#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 13225#L17-3 assume !(merge_~i~0 < merge_~n); 13228#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 13244#L8 assume true; 13271#merge_sortEXIT >#88#return; 13254#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 13255#L11-3 assume !!(merge_~k~0 < merge_~n); 13533#L12 assume !(merge_~j~0 == merge_~n); 13532#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 13530#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 13531#L14-2 merge_#t~ite14 := merge_#t~ite13; 13541#L13-2 merge_#t~ite15 := merge_#t~ite14; 13526#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 13525#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13278#L11-3 assume !!(merge_~k~0 < merge_~n); 13279#L12 [2018-11-23 06:31:28,034 INFO L796 eck$LassoCheckResult]: Loop: 13279#L12 assume !(merge_~j~0 == merge_~n); 13240#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 13241#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 13259#L14-2 merge_#t~ite14 := merge_#t~ite13; 13245#L13-2 merge_#t~ite15 := merge_#t~ite14; 13246#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 13269#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13274#L11-3 assume !!(merge_~k~0 < merge_~n); 13279#L12 [2018-11-23 06:31:28,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2018-11-23 06:31:28,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:28,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:28,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:28,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:28,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 06:31:28,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:31:28,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16c36176-5f07-4c6c-b304-8b679819660e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:31:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:31:28,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:31:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 06:31:28,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:31:28,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-23 06:31:28,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:31:28,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2018-11-23 06:31:28,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:28,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 06:31:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:31:28,368 INFO L87 Difference]: Start difference. First operand 325 states and 404 transitions. cyclomatic complexity: 100 Second operand 21 states. [2018-11-23 06:31:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:31:29,233 INFO L93 Difference]: Finished difference Result 771 states and 956 transitions. [2018-11-23 06:31:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 06:31:29,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 956 transitions. [2018-11-23 06:31:29,237 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 208 [2018-11-23 06:31:29,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 771 states and 956 transitions. [2018-11-23 06:31:29,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2018-11-23 06:31:29,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2018-11-23 06:31:29,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 771 states and 956 transitions. [2018-11-23 06:31:29,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:31:29,241 INFO L705 BuchiCegarLoop]: Abstraction has 771 states and 956 transitions. [2018-11-23 06:31:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states and 956 transitions. [2018-11-23 06:31:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 333. [2018-11-23 06:31:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 06:31:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 412 transitions. [2018-11-23 06:31:29,250 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 412 transitions. [2018-11-23 06:31:29,250 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 412 transitions. [2018-11-23 06:31:29,250 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 06:31:29,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 412 transitions. [2018-11-23 06:31:29,252 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-11-23 06:31:29,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:31:29,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:31:29,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:29,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:29,255 INFO L794 eck$LassoCheckResult]: Stem: 14633#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14608#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 14609#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 14585#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 14586#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 14645#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 14646#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 14587#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 14588#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 14648#L40-3 assume !(main_~i~1 < main_~n~0); 14580#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 14615#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14681#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 14642#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 14643#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14640#L24 assume ~n < 2; 14700#L8 assume true; 14699#merge_sortEXIT >#86#return; 14598#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 14674#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14693#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 14677#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 14678#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14692#L24 assume ~n < 2; 14691#L8 assume true; 14676#merge_sortEXIT >#86#return; 14592#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 14644#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 14591#L24 assume ~n < 2; 14593#L8 assume true; 14810#merge_sortEXIT >#88#return; 14809#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 14807#L11-3 assume !!(merge_~k~0 < merge_~n); 14808#L12 assume !(merge_~j~0 == merge_~n); 14739#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 14758#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 14624#L14-2 merge_#t~ite14 := merge_#t~ite13; 14626#L13-2 merge_#t~ite15 := merge_#t~ite14; 14760#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 14715#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 14742#L11-3 assume !!(merge_~k~0 < merge_~n); 14717#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 14714#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 14708#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 14704#L11-3 assume !(merge_~k~0 < merge_~n); 14661#L11-4 merge_~i~0 := 0; 14662#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 14657#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 14658#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 14653#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 14651#L17-3 assume !(merge_~i~0 < merge_~n); 14652#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 14610#L8 assume true; 14611#merge_sortEXIT >#88#return; 14612#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 14613#L11-3 assume !!(merge_~k~0 < merge_~n); 14898#L12 assume !(merge_~j~0 == merge_~n); 14897#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 14895#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 14894#L14-2 merge_#t~ite14 := merge_#t~ite13; 14893#L13-2 merge_#t~ite15 := merge_#t~ite14; 14892#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 14890#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 14891#L11-3 assume !!(merge_~k~0 < merge_~n); 14620#L12 [2018-11-23 06:31:29,255 INFO L796 eck$LassoCheckResult]: Loop: 14620#L12 assume !(merge_~j~0 == merge_~n); 14595#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 14596#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 14616#L14-2 merge_#t~ite14 := merge_#t~ite13; 14906#L13-2 merge_#t~ite15 := merge_#t~ite14; 14905#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite13;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~mem12; 14904#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 14900#L11-3 assume !!(merge_~k~0 < merge_~n); 14620#L12 [2018-11-23 06:31:29,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2018-11-23 06:31:29,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2018-11-23 06:31:29,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:29,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2018-11-23 06:31:29,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:31:29,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:31:29,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:31:29,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:31:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:31:29,482 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-23 06:31:30,861 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 265 DAG size of output: 215 [2018-11-23 06:31:31,027 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 06:31:31,196 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-23 06:31:31,355 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-23 06:31:32,977 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 271 DAG size of output: 238 [2018-11-23 06:31:33,520 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-23 06:31:33,641 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-23 06:31:34,060 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-23 06:31:34,720 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-23 06:31:36,014 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 193 DAG size of output: 183 [2018-11-23 06:31:36,490 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-11-23 06:31:36,492 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:31:36,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:31:36,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:31:36,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:31:36,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:31:36,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:31:36,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:31:36,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:31:36,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration17_Lasso [2018-11-23 06:31:36,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:31:36,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:31:36,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,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-11-23 06:31:36,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:31:36,864 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 06:31:36,866 INFO L168 Benchmark]: Toolchain (without parser) took 25545.27 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 845.2 MB). Free memory was 959.2 MB in the beginning and 1.4 GB in the end (delta: -479.8 MB). Peak memory consumption was 948.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:31:36,866 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:31:36,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:31:36,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.61 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:31:36,867 INFO L168 Benchmark]: Boogie Preprocessor took 57.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -219.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:31:36,867 INFO L168 Benchmark]: RCFGBuilder took 285.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:31:36,867 INFO L168 Benchmark]: BuchiAutomizer took 25013.09 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 673.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -294.7 MB). Peak memory consumption was 961.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:31:36,870 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.61 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -219.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 285.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25013.09 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 673.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -294.7 MB). Peak memory consumption was 961.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...