./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/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_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/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-5842f4b [2018-11-18 16:55:08,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:55:08,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:55:08,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:55:08,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:55:08,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:55:08,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:55:08,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:55:08,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:55:08,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:55:08,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:55:08,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:55:08,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:55:08,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:55:08,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:55:08,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:55:08,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:55:08,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:55:08,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:55:08,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:55:08,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:55:08,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:55:08,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:55:08,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:55:08,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:55:08,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:55:08,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:55:08,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:55:08,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:55:08,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:55:08,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:55:08,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:55:08,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:55:08,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:55:08,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:55:08,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:55:08,610 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:55:08,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:55:08,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:55:08,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:55:08,622 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:55:08,622 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:55:08,622 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:55:08,622 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:55:08,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:55:08,623 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:55:08,624 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:55:08,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:55:08,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:55:08,625 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:55:08,626 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:55:08,626 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_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/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-11-18 16:55:08,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:55:08,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:55:08,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:55:08,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:55:08,658 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:55:08,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:55:08,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/data/91dd25f8d/1c1fd2e76647428ab6f6e0bc703425bc/FLAG1a3f5363a [2018-11-18 16:55:09,115 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:55:09,115 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:55:09,121 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/data/91dd25f8d/1c1fd2e76647428ab6f6e0bc703425bc/FLAG1a3f5363a [2018-11-18 16:55:09,133 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/data/91dd25f8d/1c1fd2e76647428ab6f6e0bc703425bc [2018-11-18 16:55:09,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:55:09,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:55:09,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:09,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:55:09,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:55:09,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a705789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09, skipping insertion in model container [2018-11-18 16:55:09,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:55:09,176 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:55:09,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:09,364 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:55:09,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:09,465 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:55:09,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09 WrapperNode [2018-11-18 16:55:09,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:09,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:55:09,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:55:09,466 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:55:09,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:55:09,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:55:09,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:55:09,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:55:09,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... [2018-11-18 16:55:09,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:55:09,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:55:09,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:55:09,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:55:09,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:55:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:55:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:55:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:55:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:55:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:55:09,691 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:55:09,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:09 BoogieIcfgContainer [2018-11-18 16:55:09,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:55:09,692 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:55:09,692 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:55:09,696 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:55:09,697 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:09,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:55:09" (1/3) ... [2018-11-18 16:55:09,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ab52a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:55:09, skipping insertion in model container [2018-11-18 16:55:09,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:09,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:09" (2/3) ... [2018-11-18 16:55:09,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ab52a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:55:09, skipping insertion in model container [2018-11-18 16:55:09,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:09,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:09" (3/3) ... [2018-11-18 16:55:09,700 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:55:09,747 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:55:09,747 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:55:09,747 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:55:09,748 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:55:09,748 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:55:09,748 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:55:09,748 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:55:09,748 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:55:09,748 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:55:09,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:55:09,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:55:09,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:09,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:09,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:09,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:55:09,784 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:55:09,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:55:09,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:55:09,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:09,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:09,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:09,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:55:09,794 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#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;assume { :begin_inline_SelectionSort } true;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; 15#L543-4true [2018-11-18 16:55:09,794 INFO L796 eck$LassoCheckResult]: Loop: 15#L543-4true assume true; 9#L543-1true 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; 6#L547-4true assume !true; 10#L547-5true 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); 13#L543-3true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 15#L543-4true [2018-11-18 16:55:09,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 16:55:09,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:09,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:09,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 41206976, now seen corresponding path program 1 times [2018-11-18 16:55:09,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:09,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:55:09,912 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:55:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:55:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:55:09,923 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 16:55:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:09,928 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-18 16:55:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:55:09,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-18 16:55:09,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:55:09,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 15 transitions. [2018-11-18 16:55:09,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 16:55:09,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 16:55:09,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-18 16:55:09,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:09,937 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 16:55:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-18 16:55:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 16:55:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 16:55:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 16:55:09,961 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 16:55:09,961 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 16:55:09,961 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:55:09,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 16:55:09,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:55:09,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:09,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:09,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:09,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:55:09,962 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 41#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 47#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;assume { :begin_inline_SelectionSort } true;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; 48#L543-4 [2018-11-18 16:55:09,963 INFO L796 eck$LassoCheckResult]: Loop: 48#L543-4 assume true; 44#L543-1 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; 45#L547-4 assume true; 49#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 42#L547-5 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); 43#L543-3 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 48#L543-4 [2018-11-18 16:55:09,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 16:55:09,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:09,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:09,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1276986667, now seen corresponding path program 1 times [2018-11-18 16:55:09,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:09,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:55:10,010 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:55:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:55:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:10,010 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 16:55:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:10,034 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-18 16:55:10,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:55:10,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-18 16:55:10,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:55:10,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 16:55:10,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 16:55:10,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:55:10,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 16:55:10,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:10,036 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 16:55:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 16:55:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 16:55:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 16:55:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 16:55:10,038 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 16:55:10,038 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 16:55:10,038 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:55:10,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 16:55:10,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:55:10,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:10,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:10,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:10,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:10,040 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 73#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 79#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;assume { :begin_inline_SelectionSort } true;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; 80#L543-4 [2018-11-18 16:55:10,040 INFO L796 eck$LassoCheckResult]: Loop: 80#L543-4 assume true; 76#L543-1 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; 77#L547-4 assume true; 81#L547-1 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); 82#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 83#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 84#L547-4 assume true; 85#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 74#L547-5 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); 75#L543-3 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 80#L543-4 [2018-11-18 16:55:10,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-18 16:55:10,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:10,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:10,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 597028914, now seen corresponding path program 1 times [2018-11-18 16:55:10,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash 930644758, now seen corresponding path program 1 times [2018-11-18 16:55:10,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:10,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:10,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:10,218 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-11-18 16:55:10,318 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:10,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:10,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:10,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:10,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:10,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:10,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:10,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:10,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 16:55:10,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:10,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:10,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:10,738 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:10,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:10,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:10,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:10,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:10,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:10,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,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-11-18 16:55:10,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,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-11-18 16:55:10,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:10,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:10,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:10,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:10,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:10,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:10,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:10,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:10,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:10,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:10,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:10,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:10,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:10,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:10,875 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:10,875 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:10,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:10,879 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:55:10,879 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:10,879 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 - 4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2018-11-18 16:55:10,893 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 16:55:10,900 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:55:10,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:10,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:10,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:10,989 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 16:55:10,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-18 16:55:11,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 24 states and 30 transitions. Complement of second has 8 states. [2018-11-18 16:55:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:55:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-18 16:55:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 16:55:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 16:55:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 20 letters. [2018-11-18 16:55:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-18 16:55:11,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2018-11-18 16:55:11,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 16:55:11,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 16:55:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-18 16:55:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:11,063 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 16:55:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-18 16:55:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-18 16:55:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 16:55:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-18 16:55:11,065 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 16:55:11,065 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 16:55:11,065 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:55:11,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-18 16:55:11,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:11,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:11,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:55:11,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:55:11,066 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 197#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 205#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;assume { :begin_inline_SelectionSort } true;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; 206#L543-4 assume true; 198#L543-1 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; 199#L547-4 [2018-11-18 16:55:11,066 INFO L796 eck$LassoCheckResult]: Loop: 199#L547-4 assume true; 207#L547-1 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); 208#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 212#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 199#L547-4 [2018-11-18 16:55:11,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,066 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 16:55:11,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 1 times [2018-11-18 16:55:11,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2015039279, now seen corresponding path program 1 times [2018-11-18 16:55:11,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,250 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:11,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:11,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:11,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:11,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:11,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:11,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:11,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:11,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 16:55:11,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:11,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:11,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:11,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:11,523 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:11,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:11,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:11,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:11,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:11,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:11,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:11,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:11,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:11,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:11,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:11,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:11,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:11,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:11,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:11,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:11,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:11,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:11,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:11,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:11,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,549 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:55:11,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:55:11,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:11,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:11,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:11,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:11,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:11,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:11,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:11,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:11,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:11,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:11,608 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 16:55:11,609 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 16:55:11,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:11,610 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 16:55:11,611 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:11,611 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) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset >= 0] [2018-11-18 16:55:11,630 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 16:55:11,632 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:55:11,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:11,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:11,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 16:55:11,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 16:55:11,737 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 50 states and 64 transitions. Complement of second has 8 states. [2018-11-18 16:55:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:55:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-18 16:55:11,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 16:55:11,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 16:55:11,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 16:55:11,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:11,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2018-11-18 16:55:11,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 33 states and 41 transitions. [2018-11-18 16:55:11,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 16:55:11,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 16:55:11,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-18 16:55:11,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:11,744 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-18 16:55:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-18 16:55:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-18 16:55:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 16:55:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-18 16:55:11,746 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-18 16:55:11,746 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-18 16:55:11,746 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:55:11,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-18 16:55:11,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:11,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:11,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:11,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:55:11,748 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 344#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 352#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;assume { :begin_inline_SelectionSort } true;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; 353#L543-4 assume true; 358#L543-1 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; 363#L547-4 assume true; 364#L547-1 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); 362#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 360#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 361#L547-4 assume true; 356#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 349#L547-5 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); 350#L543-3 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 357#L543-4 assume true; 345#L543-1 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; 346#L547-4 [2018-11-18 16:55:11,748 INFO L796 eck$LassoCheckResult]: Loop: 346#L547-4 assume true; 354#L547-1 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); 355#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 359#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 346#L547-4 [2018-11-18 16:55:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1805761917, now seen corresponding path program 1 times [2018-11-18 16:55:11,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:11,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:55:11,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35df70e-fba3-4c1d-ac32-b40c49cc99d2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:55:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:11,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:55:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 16:55:11,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:55:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 2 times [2018-11-18 16:55:11,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:55:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:55:11,916 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 16:55:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:11,957 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-18 16:55:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:55:11,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2018-11-18 16:55:11,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 48 states and 61 transitions. [2018-11-18 16:55:11,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 16:55:11,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 16:55:11,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2018-11-18 16:55:11,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:11,960 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-18 16:55:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2018-11-18 16:55:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-11-18 16:55:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 16:55:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2018-11-18 16:55:11,964 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-18 16:55:11,964 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-18 16:55:11,964 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:55:11,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2018-11-18 16:55:11,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:55:11,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:11,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:11,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:11,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:55:11,965 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 483#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 484#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 492#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;assume { :begin_inline_SelectionSort } true;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; 493#L543-4 assume true; 499#L543-1 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; 517#L547-4 assume true; 516#L547-1 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); 515#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 514#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 504#L547-4 assume true; 496#L547-1 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); 497#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 503#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 508#L547-4 assume true; 505#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 485#L547-5 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); 486#L543-3 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 498#L543-4 assume true; 487#L543-1 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; 488#L547-4 [2018-11-18 16:55:11,966 INFO L796 eck$LassoCheckResult]: Loop: 488#L547-4 assume true; 494#L547-1 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); 495#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 500#L547-3 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 488#L547-4 [2018-11-18 16:55:11,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash -582555002, now seen corresponding path program 2 times [2018-11-18 16:55:11,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 3 times [2018-11-18 16:55:11,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:11,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:11,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1288920819, now seen corresponding path program 1 times [2018-11-18 16:55:11,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:11,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:12,334 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2018-11-18 16:55:12,430 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:12,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:12,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:12,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:12,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:12,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:12,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:12,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:12,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 16:55:12,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:12,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:12,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:12,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:12,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:12,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:12,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:12,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:12,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:12,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:12,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:12,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:12,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:12,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:12,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:12,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:12,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:12,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:12,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:12,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:12,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:12,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:12,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:12,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,791 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:55:12,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,792 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:55:12,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:12,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:12,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:55:12,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:12,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:12,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:12,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:12,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:55:12,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:55:12,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:12,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:12,823 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:12,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:12,824 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:55:12,824 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:12,824 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-11-18 16:55:12,855 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 16:55:12,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:12,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:12,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:55:12,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 16:55:12,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 52 states and 65 transitions. Complement of second has 7 states. [2018-11-18 16:55:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 16:55:12,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 16:55:12,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:12,916 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:55:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:12,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:12,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:12,955 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-11-18 16:55:12,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 16:55:12,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 52 states and 65 transitions. Complement of second has 7 states. [2018-11-18 16:55:12,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 16:55:12,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 16:55:12,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:12,974 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:55:12,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:13,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:13,012 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-11-18 16:55:13,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 16:55:13,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 58 states and 76 transitions. Complement of second has 6 states. [2018-11-18 16:55:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 16:55:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 16:55:13,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 24 letters. Loop has 4 letters. [2018-11-18 16:55:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:13,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-18 16:55:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:13,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 76 transitions. [2018-11-18 16:55:13,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:55:13,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2018-11-18 16:55:13,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:55:13,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:55:13,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:55:13,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:13,029 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:13,029 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:13,029 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:13,030 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:55:13,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:55:13,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:55:13,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:55:13,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:55:13 BoogieIcfgContainer [2018-11-18 16:55:13,035 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:55:13,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:55:13,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:55:13,035 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:55:13,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:09" (3/4) ... [2018-11-18 16:55:13,039 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:55:13,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:55:13,040 INFO L168 Benchmark]: Toolchain (without parser) took 3904.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 957.0 MB in the beginning and 1.0 GB in the end (delta: -61.2 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,040 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:55:13,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,042 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,042 INFO L168 Benchmark]: RCFGBuilder took 182.33 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,042 INFO L168 Benchmark]: BuchiAutomizer took 3342.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.6 MB). Peak memory consumption was 154.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:13,043 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:55:13,049 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.33 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3342.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.6 MB). Peak memory consumption was 154.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * i + -1 * a and consists of 5 locations. One deterministic module has affine ranking function -4 * j + 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. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 106 SDtfs, 106 SDslu, 69 SDs, 0 SdLazy, 95 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp70 div100 bol100 ite100 ukn100 eq171 hnf85 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...