./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/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_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/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-1dbac8b [2018-11-10 08:05:30,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:05:30,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:05:30,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:05:30,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:05:30,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:05:30,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:05:30,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:05:30,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:05:30,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:05:30,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:05:30,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:05:30,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:05:30,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:05:30,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:05:30,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:05:30,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:05:30,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:05:30,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:05:30,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:05:30,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:05:30,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:05:30,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:05:30,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:05:30,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:05:30,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:05:30,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:05:30,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:05:30,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:05:30,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:05:30,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:05:30,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:05:30,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:05:30,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:05:30,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:05:30,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:05:30,362 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:05:30,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:05:30,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:05:30,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:05:30,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:05:30,374 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:05:30,374 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:05:30,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:05:30,374 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:05:30,374 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:05:30,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:05:30,375 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:05:30,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:05:30,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:05:30,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:05:30,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:05:30,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:05:30,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:05:30,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:05:30,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:05:30,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:05:30,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:05:30,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:05:30,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:05:30,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:05:30,378 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:05:30,379 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:05:30,379 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_0bd18aed-1d5f-431e-8c54-bac01e2210d3/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-10 08:05:30,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:05:30,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:05:30,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:05:30,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:05:30,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:05:30,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:05:30,457 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/data/3d3f7c0f2/87387ec5232d41bd88feeea9aae31b9b/FLAGa75975e6c [2018-11-10 08:05:30,885 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:05:30,885 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:05:30,892 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/data/3d3f7c0f2/87387ec5232d41bd88feeea9aae31b9b/FLAGa75975e6c [2018-11-10 08:05:30,901 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/bin-2019/uautomizer/data/3d3f7c0f2/87387ec5232d41bd88feeea9aae31b9b [2018-11-10 08:05:30,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:05:30,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:05:30,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:05:30,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:05:30,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:05:30,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:05:30" (1/1) ... [2018-11-10 08:05:30,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df4f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:30, skipping insertion in model container [2018-11-10 08:05:30,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:05:30" (1/1) ... [2018-11-10 08:05:30,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:05:30,947 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:05:31,131 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:05:31,141 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:05:31,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:05:31,203 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:05:31,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31 WrapperNode [2018-11-10 08:05:31,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:05:31,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:05:31,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:05:31,204 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:05:31,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:05:31,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:05:31,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:05:31,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:05:31,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... [2018-11-10 08:05:31,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:05:31,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:05:31,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:05:31,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:05:31,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/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-10 08:05:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:05:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:05:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:05:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:05:31,580 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:05:31,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:05:31 BoogieIcfgContainer [2018-11-10 08:05:31,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:05:31,581 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:05:31,581 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:05:31,585 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:05:31,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:05:31,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:05:30" (1/3) ... [2018-11-10 08:05:31,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed9548d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:05:31, skipping insertion in model container [2018-11-10 08:05:31,587 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:05:31,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:05:31" (2/3) ... [2018-11-10 08:05:31,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed9548d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:05:31, skipping insertion in model container [2018-11-10 08:05:31,588 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:05:31,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:05:31" (3/3) ... [2018-11-10 08:05:31,590 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:05:31,646 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:05:31,647 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:05:31,647 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:05:31,647 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:05:31,648 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:05:31,648 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:05:31,648 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:05:31,648 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:05:31,648 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:05:31,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 08:05:31,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 08:05:31,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:31,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:31,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 08:05:31,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:31,691 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:05:31,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 08:05:31,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 08:05:31,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:31,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:31,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 08:05:31,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:31,700 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 25#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L559-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 20#L543-3true [2018-11-10 08:05:31,700 INFO L795 eck$LassoCheckResult]: Loop: 20#L543-3true assume true; 14#L543-1true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 9#L547-4true assume !true; 15#L547-5true SUMMARY for call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L547-5 17#L552true SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6; 12#L553true SUMMARY for call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L553 18#L553-1true SUMMARY for call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L553-1 19#L553-2true havoc SelectionSort_#t~mem7; 8#L554true SUMMARY for call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L554 13#L554-1true SelectionSort_#t~pre2 := SelectionSort_~i~0 + 1;SelectionSort_~i~0 := SelectionSort_~i~0 + 1;havoc SelectionSort_#t~pre2; 20#L543-3true [2018-11-10 08:05:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 08:05:31,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:31,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:31,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1630531084, now seen corresponding path program 1 times [2018-11-10 08:05:31,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:31,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:31,844 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-10 08:05:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:05:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:05:31,849 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:05:31,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:05:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:05:31,861 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 08:05:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:05:31,867 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 08:05:31,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:05:31,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 08:05:31,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 08:05:31,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 08:05:31,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 08:05:31,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 08:05:31,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 08:05:31,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:05:31,873 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 08:05:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 08:05:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 08:05:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 08:05:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 08:05:31,893 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 08:05:31,893 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 08:05:31,894 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:05:31,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 08:05:31,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 08:05:31,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:31,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:31,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 08:05:31,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:31,895 INFO L793 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 66#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 57#L559-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 58#L543-3 [2018-11-10 08:05:31,895 INFO L795 eck$LassoCheckResult]: Loop: 58#L543-3 assume true; 69#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 62#L547-4 assume true; 59#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 60#L547-5 SUMMARY for call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L547-5 70#L552 SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6; 67#L553 SUMMARY for call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L553 68#L553-1 SUMMARY for call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L553-1 72#L553-2 havoc SelectionSort_#t~mem7; 63#L554 SUMMARY for call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L554 64#L554-1 SelectionSort_#t~pre2 := SelectionSort_~i~0 + 1;SelectionSort_~i~0 := SelectionSort_~i~0 + 1;havoc SelectionSort_#t~pre2; 58#L543-3 [2018-11-10 08:05:31,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 08:05:31,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:31,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:31,912 INFO L82 PathProgramCache]: Analyzing trace with hash 866885315, now seen corresponding path program 1 times [2018-11-10 08:05:31,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:31,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:31,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:05:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:31,945 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-10 08:05:31,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:05:31,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:05:31,946 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:05:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:05:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:05:31,946 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 08:05:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:05:31,981 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 08:05:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:05:31,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 08:05:31,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 08:05:31,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 08:05:31,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 08:05:31,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 08:05:31,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 08:05:31,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:05:31,984 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 08:05:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 08:05:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 08:05:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 08:05:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 08:05:31,985 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 08:05:31,985 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 08:05:31,986 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:05:31,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 08:05:31,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 08:05:31,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:31,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:31,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 08:05:31,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:31,987 INFO L793 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 112#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 103#L559-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 104#L543-3 [2018-11-10 08:05:31,987 INFO L795 eck$LassoCheckResult]: Loop: 104#L543-3 assume true; 115#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 110#L547-4 assume true; 105#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 106#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 100#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 101#L549-2 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 102#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 107#L547-4 assume true; 120#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 116#L547-5 SUMMARY for call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L547-5 117#L552 SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6; 113#L553 SUMMARY for call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L553 114#L553-1 SUMMARY for call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L553-1 119#L553-2 havoc SelectionSort_#t~mem7; 108#L554 SUMMARY for call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L554 109#L554-1 SelectionSort_#t~pre2 := SelectionSort_~i~0 + 1;SelectionSort_~i~0 := SelectionSort_~i~0 + 1;havoc SelectionSort_#t~pre2; 104#L543-3 [2018-11-10 08:05:31,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-10 08:05:31,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1606104327, now seen corresponding path program 1 times [2018-11-10 08:05:32,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:32,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:05:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1169821803, now seen corresponding path program 1 times [2018-11-10 08:05:32,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:32,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:32,201 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-11-10 08:05:32,336 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:05:32,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:05:32,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:05:32,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:05:32,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:05:32,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:05:32,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:05:32,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:05:32,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 08:05:32,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:05:32,338 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:05:32,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,499 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-10 08:05:32,624 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-10 08:05:32,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:32,917 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:05:32,920 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:05:32,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:32,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:32,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:32,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:32,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:32,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:32,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:32,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:32,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,956 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:05:32,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,960 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:05:32,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:32,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:32,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:32,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:32,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:32,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:32,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:32,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:32,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:32,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:32,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:33,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:05:33,104 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 08:05:33,105 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 08:05:33,107 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:05:33,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:05:33,108 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:05:33,109 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-11-10 08:05:33,127 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 08:05:33,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:33,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:33,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:05:33,195 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-10 08:05:33,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 08:05:33,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 6 states. [2018-11-10 08:05:33,226 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-10 08:05:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:05:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 08:05:33,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 17 letters. [2018-11-10 08:05:33,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:33,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 21 letters. Loop has 17 letters. [2018-11-10 08:05:33,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:33,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 34 letters. [2018-11-10 08:05:33,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:33,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2018-11-10 08:05:33,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:33,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 37 transitions. [2018-11-10 08:05:33,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 08:05:33,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 08:05:33,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2018-11-10 08:05:33,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:05:33,231 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-10 08:05:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2018-11-10 08:05:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-10 08:05:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 08:05:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-10 08:05:33,233 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-10 08:05:33,233 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-10 08:05:33,233 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:05:33,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-10 08:05:33,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:33,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:33,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:33,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:05:33,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:05:33,235 INFO L793 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 279#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 267#L559-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 268#L543-3 assume true; 283#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 273#L547-4 [2018-11-10 08:05:33,235 INFO L795 eck$LassoCheckResult]: Loop: 273#L547-4 assume true; 269#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 270#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 261#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 262#L549-2 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 265#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 273#L547-4 [2018-11-10 08:05:33,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 08:05:33,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143115, now seen corresponding path program 1 times [2018-11-10 08:05:33,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:33,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 577380436, now seen corresponding path program 1 times [2018-11-10 08:05:33,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:33,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:33,470 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:05:33,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:05:33,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:05:33,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:05:33,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:05:33,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:05:33,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:05:33,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:05:33,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 08:05:33,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:05:33,471 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:05:33,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,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-10 08:05:33,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,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-10 08:05:33,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-10 08:05:33,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:33,867 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:05:33,868 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:05:33,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:33,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:33,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:33,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:33,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:05:33,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,914 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:05:33,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,915 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:05:33,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:33,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:33,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:33,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:33,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:33,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:33,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:33,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:33,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:05:33,994 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 08:05:33,995 INFO L444 ModelExtractionUtils]: 32 out of 46 variables were initially zero. Simplification set additionally 11 variables to zero. [2018-11-10 08:05:33,995 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:05:33,996 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:05:33,996 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:05:33,996 INFO L519 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-10 08:05:34,015 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 08:05:34,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:34,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:34,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:34,062 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-10 08:05:34,062 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-10 08:05:34,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 08:05:34,086 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 77 states and 91 transitions. Complement of second has 7 states. [2018-11-10 08:05:34,086 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-10 08:05:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:05:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 08:05:34,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-10 08:05:34,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:34,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 08:05:34,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:34,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 08:05:34,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:34,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 91 transitions. [2018-11-10 08:05:34,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:34,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 49 states and 57 transitions. [2018-11-10 08:05:34,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 08:05:34,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 08:05:34,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2018-11-10 08:05:34,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:05:34,091 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-10 08:05:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2018-11-10 08:05:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-11-10 08:05:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 08:05:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-10 08:05:34,096 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-10 08:05:34,096 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-10 08:05:34,096 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:05:34,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-11-10 08:05:34,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:34,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:34,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:34,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:34,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:05:34,100 INFO L793 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 462#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 450#L559-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 451#L543-3 assume true; 469#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 460#L547-4 assume true; 454#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 455#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 478#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 448#L549-2 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 449#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 457#L547-4 assume true; 474#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 466#L547-5 SUMMARY for call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L547-5 467#L552 SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6; 463#L553 SUMMARY for call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L553 464#L553-1 SUMMARY for call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L553-1 471#L553-2 havoc SelectionSort_#t~mem7; 458#L554 SUMMARY for call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L554 459#L554-1 SelectionSort_#t~pre2 := SelectionSort_~i~0 + 1;SelectionSort_~i~0 := SelectionSort_~i~0 + 1;havoc SelectionSort_#t~pre2; 465#L543-3 assume true; 468#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 456#L547-4 [2018-11-10 08:05:34,100 INFO L795 eck$LassoCheckResult]: Loop: 456#L547-4 assume true; 452#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 453#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 443#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 444#L549-2 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 447#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 456#L547-4 [2018-11-10 08:05:34,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash 495873276, now seen corresponding path program 1 times [2018-11-10 08:05:34,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:05:34,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:05:34,154 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0bd18aed-1d5f-431e-8c54-bac01e2210d3/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-10 08:05:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:34,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:05:34,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:05:34,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 08:05:34,218 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:05:34,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143115, now seen corresponding path program 2 times [2018-11-10 08:05:34,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:05:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:05:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:05:34,289 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-10 08:05:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:05:34,352 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-10 08:05:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:05:34,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2018-11-10 08:05:34,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:34,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 71 states and 84 transitions. [2018-11-10 08:05:34,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 08:05:34,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 08:05:34,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 84 transitions. [2018-11-10 08:05:34,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:05:34,356 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 84 transitions. [2018-11-10 08:05:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 84 transitions. [2018-11-10 08:05:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-11-10 08:05:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 08:05:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-10 08:05:34,362 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-10 08:05:34,362 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-10 08:05:34,363 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:05:34,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2018-11-10 08:05:34,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 08:05:34,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:05:34,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:05:34,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:05:34,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:05:34,365 INFO L793 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 661#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 649#L559-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 650#L543-3 assume true; 666#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 667#L547-4 assume true; 680#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 679#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 678#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 677#L549-2 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 656#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 657#L547-4 assume true; 653#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 654#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 645#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 646#L549-2 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 648#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 676#L547-4 assume true; 673#L547-1 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 668#L547-5 SUMMARY for call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L547-5 669#L552 SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6; 662#L553 SUMMARY for call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L553 663#L553-1 SUMMARY for call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~i~0 * 4, 4); srcloc: L553-1 671#L553-2 havoc SelectionSort_#t~mem7; 658#L554 SUMMARY for call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L554 659#L554-1 SelectionSort_#t~pre2 := SelectionSort_~i~0 + 1;SelectionSort_~i~0 := SelectionSort_~i~0 + 1;havoc SelectionSort_#t~pre2; 664#L543-3 assume true; 665#L543-1 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := SelectionSort_~i~0 + 1; 655#L547-4 [2018-11-10 08:05:34,365 INFO L795 eck$LassoCheckResult]: Loop: 655#L547-4 assume true; 651#L547-1 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); 652#L549 SUMMARY for call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~j~0 * 4, 4); srcloc: L549 643#L549-1 SUMMARY for call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + SelectionSort_~min~0 * 4, 4); srcloc: L549-1 644#L549-2 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 647#L547-3 SelectionSort_#t~pre3 := SelectionSort_~j~0 + 1;SelectionSort_~j~0 := SelectionSort_~j~0 + 1;havoc SelectionSort_#t~pre3; 655#L547-4 [2018-11-10 08:05:34,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1778786740, now seen corresponding path program 2 times [2018-11-10 08:05:34,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:34,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:05:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143115, now seen corresponding path program 3 times [2018-11-10 08:05:34,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:34,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:05:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1411337790, now seen corresponding path program 1 times [2018-11-10 08:05:34,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:05:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:05:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:05:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:05:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:05:34,806 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 120 [2018-11-10 08:05:34,874 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:05:34,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:05:34,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:05:34,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:05:34,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:05:34,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:05:34,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:05:34,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:05:34,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 08:05:34,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:05:34,875 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:05:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:34,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:35,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:35,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:35,320 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:05:35,321 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:05:35,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:35,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:35,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:35,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:35,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:05:35,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:05:35,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:05:35,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:35,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:35,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,348 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:05:35,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,349 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:05:35,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:35,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:05:35,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 08:05:35,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:05:35,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:05:35,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:05:35,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:05:35,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:05:35,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:05:35,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:05:35,393 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 08:05:35,393 INFO L444 ModelExtractionUtils]: 22 out of 34 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-10 08:05:35,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:05:35,394 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:05:35,394 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:05:35,394 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [] [2018-11-10 08:05:35,430 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 08:05:35,432 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:05:35,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:05:35,499 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-10 08:05:35,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 08:05:35,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 81 states and 94 transitions. Complement of second has 7 states. [2018-11-10 08:05:35,551 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-10 08:05:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:05:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 08:05:35,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 08:05:35,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:35,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 08:05:35,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,624 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-10 08:05:35,624 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-10 08:05:35,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 08:05:35,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 81 states and 94 transitions. Complement of second has 7 states. [2018-11-10 08:05:35,663 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-10 08:05:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:05:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 08:05:35,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 08:05:35,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:35,664 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 08:05:35,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:05:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:05:35,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:05:35,763 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-10 08:05:35,764 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-10 08:05:35,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 08:05:35,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 88 states and 106 transitions. Complement of second has 6 states. [2018-11-10 08:05:35,813 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-10 08:05:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:05:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-10 08:05:35,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 08:05:35,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:35,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 35 letters. Loop has 6 letters. [2018-11-10 08:05:35,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:35,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 29 letters. Loop has 12 letters. [2018-11-10 08:05:35,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:05:35,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 106 transitions. [2018-11-10 08:05:35,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:05:35,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:05:35,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:05:35,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:05:35,820 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:05:35,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:05:35,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:05:35,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 08:05:35,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:05:35 BoogieIcfgContainer [2018-11-10 08:05:35,829 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:05:35,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:05:35,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:05:35,829 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:05:35,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:05:31" (3/4) ... [2018-11-10 08:05:35,834 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 08:05:35,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:05:35,835 INFO L168 Benchmark]: Toolchain (without parser) took 4931.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -233.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:05:35,836 INFO L168 Benchmark]: CDTParser took 0.11 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-10 08:05:35,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:35,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:35,838 INFO L168 Benchmark]: Boogie Preprocessor took 16.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:35,838 INFO L168 Benchmark]: RCFGBuilder took 282.31 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:35,839 INFO L168 Benchmark]: BuchiAutomizer took 4248.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:05:35,839 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:05:35,842 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.31 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4248.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * i + array_size and consists of 4 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + -1 * a + unknown-#length-unknown[a] 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 4.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 150 SDtfs, 154 SDslu, 112 SDs, 0 SdLazy, 145 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf99 lsp94 ukn89 mio100 lsp59 div100 bol100 ite100 ukn100 eq171 hnf88 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...