./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44846bb6d84d04329b704265dd9929c19b9c8486 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 11:56:40,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:56:40,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:56:40,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:56:40,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:56:40,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:56:40,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:56:40,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:56:40,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:56:40,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:56:40,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:56:40,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:56:40,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:56:40,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:56:40,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:56:40,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:56:40,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:56:40,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:56:40,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:56:40,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:56:40,340 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:56:40,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:56:40,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:56:40,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:56:40,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:56:40,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:56:40,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:56:40,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:56:40,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:56:40,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:56:40,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:56:40,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:56:40,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:56:40,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:56:40,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:56:40,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:56:40,346 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 11:56:40,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:56:40,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:56:40,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 11:56:40,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 11:56:40,354 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 11:56:40,354 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 11:56:40,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 11:56:40,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 11:56:40,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 11:56:40,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 11:56:40,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 11:56:40,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 11:56:40,357 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_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44846bb6d84d04329b704265dd9929c19b9c8486 [2018-12-02 11:56:40,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:56:40,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:56:40,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:56:40,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:56:40,383 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:56:40,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:56:40,417 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/data/befb6c35d/babf71c3f67a4dd9997c2078a022a0b5/FLAGc479420ae [2018-12-02 11:56:40,864 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:56:40,865 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:56:40,871 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/data/befb6c35d/babf71c3f67a4dd9997c2078a022a0b5/FLAGc479420ae [2018-12-02 11:56:40,879 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/data/befb6c35d/babf71c3f67a4dd9997c2078a022a0b5 [2018-12-02 11:56:40,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:56:40,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:56:40,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:56:40,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:56:40,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:56:40,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:56:40" (1/1) ... [2018-12-02 11:56:40,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:40, skipping insertion in model container [2018-12-02 11:56:40,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:56:40" (1/1) ... [2018-12-02 11:56:40,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:56:40,908 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:56:41,052 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:56:41,061 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:56:41,123 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:56:41,142 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:56:41,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41 WrapperNode [2018-12-02 11:56:41,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:56:41,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:56:41,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:56:41,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:56:41,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:56:41,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:56:41,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:56:41,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:56:41,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... [2018-12-02 11:56:41,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:56:41,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:56:41,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:56:41,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:56:41,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 11:56:41,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 11:56:41,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 11:56:41,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 11:56:41,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 11:56:41,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:56:41,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:56:41,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:56:41,335 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 11:56:41,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:56:41 BoogieIcfgContainer [2018-12-02 11:56:41,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:56:41,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 11:56:41,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 11:56:41,338 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 11:56:41,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 11:56:41,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 11:56:40" (1/3) ... [2018-12-02 11:56:41,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 11:56:41, skipping insertion in model container [2018-12-02 11:56:41,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 11:56:41,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:56:41" (2/3) ... [2018-12-02 11:56:41,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 11:56:41, skipping insertion in model container [2018-12-02 11:56:41,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 11:56:41,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:56:41" (3/3) ... [2018-12-02 11:56:41,341 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:56:41,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 11:56:41,374 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 11:56:41,375 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 11:56:41,375 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 11:56:41,375 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:56:41,375 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:56:41,375 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 11:56:41,375 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:56:41,375 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 11:56:41,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 11:56:41,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 11:56:41,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:41,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:41,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 11:56:41,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 11:56:41,400 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 11:56:41,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 11:56:41,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 11:56:41,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:41,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:41,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 11:56:41,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 11:56:41,406 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L559-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 11#L543-3true [2018-12-02 11:56:41,407 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 5#L547-3true assume !true; 6#L547-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 10#L543-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 11#L543-3true [2018-12-02 11:56:41,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-02 11:56:41,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-12-02 11:56:41,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:41,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:41,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:56:41,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:56:41,502 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 11:56:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 11:56:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 11:56:41,512 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-02 11:56:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:56:41,516 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-02 11:56:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 11:56:41,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-02 11:56:41,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 11:56:41,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-12-02 11:56:41,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 11:56:41,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 11:56:41,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-02 11:56:41,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 11:56:41,521 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 11:56:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-02 11:56:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 11:56:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 11:56:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 11:56:41,538 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 11:56:41,538 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 11:56:41,538 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 11:56:41,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 11:56:41,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 11:56:41,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:41,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:41,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 11:56:41,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 11:56:41,539 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 37#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 40#L543-3 [2018-12-02 11:56:41,539 INFO L796 eck$LassoCheckResult]: Loop: 40#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 39#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 40#L543-3 [2018-12-02 11:56:41,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-02 11:56:41,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-12-02 11:56:41,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:41,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:56:41,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:56:41,569 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 11:56:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:56:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:56:41,570 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-02 11:56:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:56:41,580 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-02 11:56:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:56:41,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-12-02 11:56:41,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 11:56:41,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-12-02 11:56:41,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 11:56:41,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 11:56:41,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-02 11:56:41,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 11:56:41,582 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 11:56:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-02 11:56:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 11:56:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 11:56:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-02 11:56:41,583 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 11:56:41,583 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 11:56:41,583 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 11:56:41,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-02 11:56:41,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 11:56:41,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:41,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:41,584 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 11:56:41,584 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:56:41,584 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 66#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 67#L543-3 [2018-12-02 11:56:41,584 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 68#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 67#L543-3 [2018-12-02 11:56:41,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-12-02 11:56:41,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:41,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-12-02 11:56:41,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-12-02 11:56:41,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:41,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:41,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:41,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:41,827 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 11:56:41,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 11:56:41,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 11:56:41,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 11:56:41,828 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 11:56:41,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 11:56:41,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 11:56:41,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 11:56:41,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-02 11:56:41,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 11:56:41,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 11:56:41,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:41,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 11:56:42,159 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 11:56:42,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:42,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:42,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:42,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:42,239 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 11:56:42,280 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 11:56:42,280 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 11:56:42,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 11:56:42,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 11:56:42,283 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 11:56:42,283 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [] [2018-12-02 11:56:42,290 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 11:56:42,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 11:56:42,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:42,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:42,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:42,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 11:56:42,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 11:56:42,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-12-02 11:56:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 11:56:42,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2018-12-02 11:56:42,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:42,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2018-12-02 11:56:42,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:42,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-02 11:56:42,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:42,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-12-02 11:56:42,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:42,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-12-02 11:56:42,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 11:56:42,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 11:56:42,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-02 11:56:42,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 11:56:42,446 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-02 11:56:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-02 11:56:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-02 11:56:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 11:56:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-02 11:56:42,447 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-02 11:56:42,447 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-02 11:56:42,447 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 11:56:42,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-12-02 11:56:42,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:42,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:42,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:42,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 11:56:42,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 11:56:42,449 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 163#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 167#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 168#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 169#L547-3 [2018-12-02 11:56:42,449 INFO L796 eck$LassoCheckResult]: Loop: 169#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 174#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 171#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 169#L547-3 [2018-12-02 11:56:42,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-02 11:56:42,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-12-02 11:56:42,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:42,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:42,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-12-02 11:56:42,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:42,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:42,605 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 11:56:42,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 11:56:42,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 11:56:42,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 11:56:42,605 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 11:56:42,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 11:56:42,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 11:56:42,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 11:56:42,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-02 11:56:42,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 11:56:42,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 11:56:42,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-12-02 11:56:42,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,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-12-02 11:56:42,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-12-02 11:56:42,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:42,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 11:56:42,908 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 11:56:42,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:42,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:42,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,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-12-02 11:56:42,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:42,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:42,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:42,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:42,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:42,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:42,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:42,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:42,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:42,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:42,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:42,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:42,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:42,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 11:56:42,971 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 11:56:42,972 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 11:56:42,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 11:56:42,973 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 11:56:42,973 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 11:56:42,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2018-12-02 11:56:42,981 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 11:56:42,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 11:56:43,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:43,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 11:56:43,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 11:56:43,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2018-12-02 11:56:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 11:56:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-02 11:56:43,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-02 11:56:43,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:43,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-02 11:56:43,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:43,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-02 11:56:43,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:43,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-12-02 11:56:43,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:43,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-12-02 11:56:43,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 11:56:43,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 11:56:43,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-12-02 11:56:43,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 11:56:43,054 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-02 11:56:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-12-02 11:56:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-02 11:56:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 11:56:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-02 11:56:43,055 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 11:56:43,056 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 11:56:43,056 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 11:56:43,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-02 11:56:43,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:43,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:43,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:43,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:56:43,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 11:56:43,057 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 279#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 280#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 281#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 284#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 285#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 288#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 277#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 278#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 282#L547-3 [2018-12-02 11:56:43,057 INFO L796 eck$LassoCheckResult]: Loop: 282#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 286#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 283#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 282#L547-3 [2018-12-02 11:56:43,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-12-02 11:56:43,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:43,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:56:43,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/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-12-02 11:56:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:43,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 11:56:43,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 11:56:43,110 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 11:56:43,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-12-02 11:56:43,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:56:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:56:43,150 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-02 11:56:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:56:43,181 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-02 11:56:43,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:56:43,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-12-02 11:56:43,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:43,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-12-02 11:56:43,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 11:56:43,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 11:56:43,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-12-02 11:56:43,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 11:56:43,184 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-02 11:56:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-12-02 11:56:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-02 11:56:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 11:56:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-02 11:56:43,185 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 11:56:43,185 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 11:56:43,185 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 11:56:43,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-02 11:56:43,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:43,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:43,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:43,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:56:43,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 11:56:43,187 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 365#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 367#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 368#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 371#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 374#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 377#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 378#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 380#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 379#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 369#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 370#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 372#L547-3 [2018-12-02 11:56:43,187 INFO L796 eck$LassoCheckResult]: Loop: 372#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 373#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 372#L547-3 [2018-12-02 11:56:43,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-12-02 11:56:43,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-12-02 11:56:43,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:43,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:43,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:43,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-12-02 11:56:43,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:43,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:43,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:43,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:43,433 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2018-12-02 11:56:43,469 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 11:56:43,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 11:56:43,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 11:56:43,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 11:56:43,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 11:56:43,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 11:56:43,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 11:56:43,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 11:56:43,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-02 11:56:43,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 11:56:43,469 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 11:56:43,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,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-12-02 11:56:43,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,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-12-02 11:56:43,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-12-02 11:56:43,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-12-02 11:56:43,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:43,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-12-02 11:56:43,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-12-02 11:56:43,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 11:56:43,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 11:56:43,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:43,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:43,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:43,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:43,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:43,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:43,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:43,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:43,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:43,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:43,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:43,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,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-12-02 11:56:43,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:43,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:43,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:43,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:43,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:43,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:43,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:43,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:43,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:43,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:43,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:43,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:43,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 11:56:43,793 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 11:56:43,793 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 11:56:43,793 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 11:56:43,794 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 11:56:43,794 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 11:56:43,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~min~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = 4*ULTIMATE.start_SelectionSort_~array_size - 4*ULTIMATE.start_SelectionSort_~min~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~min~0 + 1*ULTIMATE.start_SelectionSort_~j~0 - 1 >= 0] [2018-12-02 11:56:43,808 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-12-02 11:56:43,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 11:56:43,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:43,877 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 11:56:43,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 11:56:43,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 8 states. [2018-12-02 11:56:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-02 11:56:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-02 11:56:43,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 11:56:43,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:43,943 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 11:56:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:43,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:43,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 11:56:43,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 11:56:44,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 43 states and 58 transitions. Complement of second has 9 states. [2018-12-02 11:56:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 11:56:44,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 11:56:44,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:44,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 11:56:44,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:44,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:44,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:44,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 11:56:44,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 11:56:44,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 7 states. [2018-12-02 11:56:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-02 11:56:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-02 11:56:44,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 11:56:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:44,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 11:56:44,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:44,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:44,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:44,287 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 11:56:44,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 11:56:44,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 55 transitions. Complement of second has 8 states. [2018-12-02 11:56:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-12-02 11:56:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 11:56:44,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 11:56:44,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:44,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 11:56:44,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:44,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 55 transitions. [2018-12-02 11:56:44,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:44,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 47 transitions. [2018-12-02 11:56:44,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 11:56:44,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 11:56:44,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-12-02 11:56:44,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 11:56:44,351 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-02 11:56:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-12-02 11:56:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-02 11:56:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 11:56:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-12-02 11:56:44,353 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-12-02 11:56:44,353 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-12-02 11:56:44,353 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 11:56:44,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-12-02 11:56:44,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:44,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:44,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:44,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:56:44,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 11:56:44,354 INFO L794 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 883#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 884#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 888#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 889#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 890#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 897#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 899#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 912#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 902#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 908#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 901#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 900#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 886#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 887#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 891#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-12-02 11:56:44,354 INFO L796 eck$LassoCheckResult]: Loop: 896#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 892#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 893#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-12-02 11:56:44,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1907134999, now seen corresponding path program 2 times [2018-12-02 11:56:44,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:44,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2018-12-02 11:56:44,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1631393568, now seen corresponding path program 3 times [2018-12-02 11:56:44,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:56:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:44,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:56:44,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e03ee985-057a-456e-8cf2-e85c730873b3/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-12-02 11:56:44,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 11:56:44,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 11:56:44,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:56:44,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:44,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 11:56:44,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-12-02 11:56:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 11:56:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-02 11:56:44,582 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 15 Second operand 17 states. [2018-12-02 11:56:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:56:44,735 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-12-02 11:56:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 11:56:44,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 110 transitions. [2018-12-02 11:56:44,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:44,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 88 transitions. [2018-12-02 11:56:44,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 11:56:44,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 11:56:44,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 88 transitions. [2018-12-02 11:56:44,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 11:56:44,737 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-12-02 11:56:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 88 transitions. [2018-12-02 11:56:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2018-12-02 11:56:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 11:56:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-12-02 11:56:44,739 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-02 11:56:44,739 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-02 11:56:44,739 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 11:56:44,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2018-12-02 11:56:44,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 11:56:44,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 11:56:44,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 11:56:44,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:56:44,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 11:56:44,740 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1094#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1095#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1099#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1100#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1101#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1132#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1129#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1126#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1124#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1122#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1120#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1113#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1118#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1112#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1111#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1097#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1098#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1102#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-12-02 11:56:44,740 INFO L796 eck$LassoCheckResult]: Loop: 1107#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1103#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1104#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-12-02 11:56:44,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash -960712718, now seen corresponding path program 3 times [2018-12-02 11:56:44,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2018-12-02 11:56:44,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1069508453, now seen corresponding path program 4 times [2018-12-02 11:56:44,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:56:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:56:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:56:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:56:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:56:45,051 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 127 [2018-12-02 11:56:45,098 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 11:56:45,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 11:56:45,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 11:56:45,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 11:56:45,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 11:56:45,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 11:56:45,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 11:56:45,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 11:56:45,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-12-02 11:56:45,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 11:56:45,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 11:56:45,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 11:56:45,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 11:56:45,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 11:56:45,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 11:56:45,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 11:56:45,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 11:56:45,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,423 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 11:56:45,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 11:56:45,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 11:56:45,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 11:56:45,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 11:56:45,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 11:56:45,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 11:56:45,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 11:56:45,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 11:56:45,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 11:56:45,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 11:56:45,464 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 11:56:45,464 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 11:56:45,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 11:56:45,465 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 11:56:45,465 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 11:56:45,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-12-02 11:56:45,489 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-12-02 11:56:45,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:45,520 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 11:56:45,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-02 11:56:45,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-12-02 11:56:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 11:56:45,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-02 11:56:45,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:45,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 11:56:45,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:45,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 11:56:45,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-02 11:56:45,583 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-12-02 11:56:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 11:56:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-02 11:56:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:45,584 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 11:56:45,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:56:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:56:45,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:56:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:56:45,613 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 11:56:45,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-02 11:56:45,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 66 states and 83 transitions. Complement of second has 6 states. [2018-12-02 11:56:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 11:56:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 11:56:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-02 11:56:45,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-02 11:56:45,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:45,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-02 11:56:45,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:45,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2018-12-02 11:56:45,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 11:56:45,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 83 transitions. [2018-12-02 11:56:45,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 11:56:45,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-02 11:56:45,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 11:56:45,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 11:56:45,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 11:56:45,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 11:56:45,628 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 11:56:45,628 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 11:56:45,628 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 11:56:45,628 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 11:56:45,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 11:56:45,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 11:56:45,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 11:56:45,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 11:56:45 BoogieIcfgContainer [2018-12-02 11:56:45,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 11:56:45,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 11:56:45,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 11:56:45,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 11:56:45,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:56:41" (3/4) ... [2018-12-02 11:56:45,637 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 11:56:45,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 11:56:45,638 INFO L168 Benchmark]: Toolchain (without parser) took 4756.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 950.6 MB in the beginning and 899.9 MB in the end (delta: 50.8 MB). Peak memory consumption was 348.6 MB. Max. memory is 11.5 GB. [2018-12-02 11:56:45,638 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:56:45,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 11:56:45,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 11:56:45,640 INFO L168 Benchmark]: Boogie Preprocessor took 14.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:56:45,640 INFO L168 Benchmark]: RCFGBuilder took 152.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-02 11:56:45,640 INFO L168 Benchmark]: BuchiAutomizer took 4297.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 191.9 MB). Peak memory consumption was 362.2 MB. Max. memory is 11.5 GB. [2018-12-02 11:56:45,641 INFO L168 Benchmark]: Witness Printer took 3.50 ms. Allocated memory is still 1.3 GB. Free memory is still 899.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:56:45,644 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 152.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4297.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 191.9 MB). Peak memory consumption was 362.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.50 ms. Allocated memory is still 1.3 GB. Free memory is still 899.9 MB. There was no memory consumed. 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. One nondeterministic module has affine ranking function 4 * array_size + -4 * min + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 140 SDtfs, 213 SDslu, 95 SDs, 0 SdLazy, 258 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp68 div100 bol100 ite100 ukn100 eq169 hnf84 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...