./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/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_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/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-aa41828 [2018-11-23 15:29:27,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:29:27,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:29:27,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:29:27,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:29:27,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:29:27,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:29:27,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:29:27,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:29:27,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:29:27,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:29:27,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:29:27,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:29:27,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:29:27,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:29:27,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:29:27,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:29:27,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:29:27,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:29:27,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:29:27,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:29:27,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:29:27,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:29:27,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:29:27,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:29:27,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:29:27,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:29:27,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:29:27,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:29:27,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:29:27,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:29:27,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:29:27,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:29:27,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:29:27,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:29:27,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:29:27,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:29:27,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:29:27,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:29:27,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:29:27,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:29:27,667 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:29:27,667 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:29:27,667 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:29:27,667 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:29:27,667 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:29:27,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:29:27,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:29:27,669 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:29:27,670 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:29:27,670 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:29:27,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:29:27,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:29:27,672 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:29:27,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:29:27,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:29:27,673 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:29:27,673 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:29:27,673 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_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/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-23 15:29:27,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:29:27,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:29:27,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:29:27,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:29:27,711 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:29:27,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:29:27,749 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/data/fd9d8cf2c/44c5f93e2a714acc9f64b7b988835aaa/FLAG2198b0969 [2018-11-23 15:29:28,081 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:29:28,082 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:29:28,088 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/data/fd9d8cf2c/44c5f93e2a714acc9f64b7b988835aaa/FLAG2198b0969 [2018-11-23 15:29:28,097 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/data/fd9d8cf2c/44c5f93e2a714acc9f64b7b988835aaa [2018-11-23 15:29:28,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:29:28,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:29:28,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:29:28,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:29:28,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:29:28,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cfc58e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28, skipping insertion in model container [2018-11-23 15:29:28,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:29:28,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:29:28,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:29:28,322 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:29:28,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:29:28,416 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:29:28,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28 WrapperNode [2018-11-23 15:29:28,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:29:28,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:29:28,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:29:28,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:29:28,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:29:28,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:29:28,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:29:28,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:29:28,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... [2018-11-23 15:29:28,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:29:28,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:29:28,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:29:28,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:29:28,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:29:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:29:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:29:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:29:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:29:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:29:28,667 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:29:28,667 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:29:28,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:28 BoogieIcfgContainer [2018-11-23 15:29:28,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:29:28,668 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:29:28,668 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:29:28,672 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:29:28,673 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:28,673 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:29:28" (1/3) ... [2018-11-23 15:29:28,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef09028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:28, skipping insertion in model container [2018-11-23 15:29:28,674 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:28,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:28" (2/3) ... [2018-11-23 15:29:28,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef09028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:28, skipping insertion in model container [2018-11-23 15:29:28,675 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:28,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:28" (3/3) ... [2018-11-23 15:29:28,676 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:29:28,720 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:29:28,721 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:29:28,721 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:29:28,721 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:29:28,721 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:29:28,722 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:29:28,722 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:29:28,722 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:29:28,722 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:29:28,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:29:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:29:28,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:28,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:28,757 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:29:28,757 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:29:28,758 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:29:28,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:29:28,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:29:28,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:28,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:28,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:29:28,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:29:28,764 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L559-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 11#L543-3true [2018-11-23 15:29:28,764 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 5#L547-3true assume !true; 6#L547-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 10#L543-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 11#L543-3true [2018-11-23 15:29:28,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 15:29:28,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-11-23 15:29:28,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:28,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:29:28,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:29:28,864 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:29:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:29:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:29:28,880 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-23 15:29:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:28,885 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-23 15:29:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:29:28,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-23 15:29:28,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:29:28,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-23 15:29:28,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:29:28,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:29:28,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 15:29:28,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:28,893 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:29:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 15:29:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 15:29:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:29:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 15:29:28,916 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:29:28,916 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:29:28,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:29:28,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 15:29:28,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:29:28,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:28,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:28,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:29:28,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:29:28,918 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 37#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 40#L543-3 [2018-11-23 15:29:28,918 INFO L796 eck$LassoCheckResult]: Loop: 40#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 39#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 40#L543-3 [2018-11-23 15:29:28,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,918 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 15:29:28,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-11-23 15:29:28,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:28,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:29:28,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:29:28,956 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:29:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:29:28,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:29:28,957 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 15:29:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:28,977 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-11-23 15:29:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:29:28,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-11-23 15:29:28,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:29:28,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 15:29:28,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:29:28,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:29:28,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 15:29:28,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:28,980 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 15:29:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 15:29:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 15:29:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 15:29:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 15:29:28,982 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 15:29:28,982 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 15:29:28,982 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:29:28,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 15:29:28,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:29:28,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:28,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:28,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:29:28,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:28,983 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 66#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 67#L543-3 [2018-11-23 15:29:28,983 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 68#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 67#L543-3 [2018-11-23 15:29:28,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,983 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-23 15:29:28,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:28,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:28,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:28,996 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-11-23 15:29:28,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:28,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:28,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:28,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:28,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:29,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-11-23 15:29:29,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:29,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:29,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:29,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:29,162 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-23 15:29:29,301 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:29,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:29,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:29,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:29,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:29,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:29,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:29,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:29,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 15:29:29,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:29,303 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:29,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,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-23 15:29:29,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-23 15:29:29,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:29,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:29,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:29,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:29,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:29,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:29,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:29,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:29,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:29,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:29,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:29,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:29,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:29,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:29,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:29,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:29,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:29,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:29,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:29,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:29,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:29,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:29,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:29,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:29,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:29,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:29,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:29,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:29,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:29,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:29,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:29,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:29,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:29,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:29,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:29,799 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:29,868 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 15:29:29,868 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 15:29:29,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:29,871 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:29,871 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:29,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2018-11-23 15:29:29,880 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:29:29,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:29,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:29,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 15:29:29,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:29:29,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 15:29:30,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2018-11-23 15:29:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:29:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 15:29:30,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2018-11-23 15:29:30,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-23 15:29:30,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-23 15:29:30,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-23 15:29:30,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-11-23 15:29:30,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:29:30,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 15:29:30,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-23 15:29:30,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:29:30,008 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 15:29:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-23 15:29:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 15:29:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 15:29:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-23 15:29:30,010 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 15:29:30,010 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 15:29:30,012 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:29:30,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-23 15:29:30,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:30,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:30,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:29:30,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:30,013 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 158#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 160#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 161#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 165#L547-3 [2018-11-23 15:29:30,014 INFO L796 eck$LassoCheckResult]: Loop: 165#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 169#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 166#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 165#L547-3 [2018-11-23 15:29:30,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 15:29:30,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-23 15:29:30,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,038 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-23 15:29:30,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:30,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:30,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:30,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:30,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:30,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:30,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:30,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:30,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-23 15:29:30,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:30,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:30,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:30,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:30,519 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:30,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:30,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:30,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:30,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:30,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:30,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:30,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:30,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:30,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:30,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:30,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:30,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:30,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:30,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:30,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:30,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:30,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:30,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:30,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:30,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:30,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:30,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:30,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:30,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:30,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:30,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:30,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-23 15:29:30,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:30,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:30,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:30,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:30,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:30,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:30,572 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:30,610 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 15:29:30,610 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 15:29:30,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:30,614 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:30,614 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:30,615 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-23 15:29:30,639 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:29:30,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:30,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:30,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:30,676 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:29:30,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 15:29:30,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2018-11-23 15:29:30,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:29:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 15:29:30,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 15:29:30,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 15:29:30,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 15:29:30,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:30,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-23 15:29:30,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-11-23 15:29:30,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:29:30,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:29:30,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-23 15:29:30,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:29:30,696 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 15:29:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-23 15:29:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-11-23 15:29:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 15:29:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 15:29:30,697 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 15:29:30,698 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 15:29:30,698 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:29:30,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 15:29:30,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:30,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:30,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:30,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:30,699 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 270#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 272#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 273#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 276#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 282#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 279#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 280#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 283#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 274#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 275#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 277#L547-3 [2018-11-23 15:29:30,699 INFO L796 eck$LassoCheckResult]: Loop: 277#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 281#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 278#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 277#L547-3 [2018-11-23 15:29:30,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-11-23 15:29:30,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:30,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:29:30,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed3a9d0a-a6ac-433c-917d-0565f0e3cdbc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:29:30,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:30,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:30,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:29:30,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 15:29:30,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:29:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-23 15:29:30,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:29:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:29:30,831 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-23 15:29:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:30,870 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-23 15:29:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:29:30,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-23 15:29:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-23 15:29:30,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 15:29:30,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 15:29:30,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-23 15:29:30,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:29:30,872 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-23 15:29:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-23 15:29:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-23 15:29:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:29:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-23 15:29:30,874 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 15:29:30,874 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 15:29:30,874 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:29:30,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-23 15:29:30,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:29:30,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:30,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:30,875 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:30,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:30,875 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 360#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 362#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 363#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 366#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 369#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 370#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 372#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 373#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 374#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 364#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 365#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 367#L547-3 [2018-11-23 15:29:30,875 INFO L796 eck$LassoCheckResult]: Loop: 367#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 371#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 368#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 367#L547-3 [2018-11-23 15:29:30,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-11-23 15:29:30,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-23 15:29:30,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-11-23 15:29:30,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:31,166 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 102 [2018-11-23 15:29:31,208 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:31,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:31,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:31,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:31,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:31,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:31,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:31,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:31,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-23 15:29:31,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:31,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:31,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:31,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:31,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:31,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:31,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:31,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:31,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:31,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:31,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:31,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:31,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:31,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:31,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:31,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:31,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:31,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:31,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:31,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:31,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:31,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:31,647 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:31,659 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:29:31,660 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:29:31,660 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:31,660 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:31,661 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:31,661 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-23 15:29:31,707 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 15:29:31,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:31,749 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:29:31,749 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 15:29:31,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2018-11-23 15:29:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:29:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 15:29:31,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:29:31,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:31,771 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:29:31,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:31,833 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-23 15:29:31,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 15:29:31,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2018-11-23 15:29:31,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:29:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 15:29:31,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:29:31,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:31,849 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:29:31,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:31,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:31,925 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-23 15:29:31,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 15:29:31,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 39 transitions. Complement of second has 6 states. [2018-11-23 15:29:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:29:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 15:29:31,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:29:31,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:31,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 15:29:31,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:31,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 15:29:31,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:31,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2018-11-23 15:29:31,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:29:31,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-23 15:29:31,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:29:31,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:29:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:29:31,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:31,947 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:31,947 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:31,947 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:31,947 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:29:31,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:29:31,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:29:31,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:29:31,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:29:31 BoogieIcfgContainer [2018-11-23 15:29:31,954 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:29:31,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:29:31,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:29:31,955 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:29:31,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:28" (3/4) ... [2018-11-23 15:29:31,958 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:29:31,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:29:31,959 INFO L168 Benchmark]: Toolchain (without parser) took 3859.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 956.5 MB in the beginning and 848.7 MB in the end (delta: 107.7 MB). Peak memory consumption was 341.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:31,960 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:31,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:31,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:31,961 INFO L168 Benchmark]: Boogie Preprocessor took 21.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:31,961 INFO L168 Benchmark]: RCFGBuilder took 192.65 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:31,962 INFO L168 Benchmark]: BuchiAutomizer took 3286.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 848.7 MB in the end (delta: 270.0 MB). Peak memory consumption was 350.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:31,962 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 848.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:31,965 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 192.65 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3286.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 848.7 MB in the end (delta: 270.0 MB). Peak memory consumption was 350.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 848.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 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.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 85 SDtfs, 79 SDslu, 37 SDs, 0 SdLazy, 84 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp68 div100 bol100 ite100 ukn100 eq169 hnf89 smp95 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...