./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/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_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/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-0cd3be1 [2018-11-28 10:33:24,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:24,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:24,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:24,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:24,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:24,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:24,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:24,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:24,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:24,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:24,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:24,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:24,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:24,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:24,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:24,955 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:24,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:24,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:24,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:24,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:24,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:24,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:24,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:24,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:24,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:24,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:24,964 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:24,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:24,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:24,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:24,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:24,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:24,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:24,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:24,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:24,968 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:33:24,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:24,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:24,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:24,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:24,980 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:33:24,980 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:33:24,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:24,981 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:33:24,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:33:24,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:24,982 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:33:24,983 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:33:24,983 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_4a842b0a-029e-4a39-95ea-d591acc145f5/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-28 10:33:25,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:25,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:25,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:25,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:25,018 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:25,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:25,057 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/data/db51fb88d/1da758ff3d8542e09f4fed81ebc79462/FLAG70033cab9 [2018-11-28 10:33:25,501 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:25,502 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:25,511 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/data/db51fb88d/1da758ff3d8542e09f4fed81ebc79462/FLAG70033cab9 [2018-11-28 10:33:25,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/data/db51fb88d/1da758ff3d8542e09f4fed81ebc79462 [2018-11-28 10:33:25,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:25,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:25,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:25,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:25,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:25,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73decd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25, skipping insertion in model container [2018-11-28 10:33:25,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:25,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:25,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:25,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:25,842 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:25,865 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:25,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25 WrapperNode [2018-11-28 10:33:25,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:25,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:25,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:25,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:25,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:25,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:25,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:25,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:25,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... [2018-11-28 10:33:25,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:25,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:25,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:25,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:25,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/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-28 10:33:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:33:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:26,106 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:26,106 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 10:33:26,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26 BoogieIcfgContainer [2018-11-28 10:33:26,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:26,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:33:26,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:33:26,109 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:33:26,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:26,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:33:25" (1/3) ... [2018-11-28 10:33:26,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3065edbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:26,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:25" (2/3) ... [2018-11-28 10:33:26,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3065edbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:26,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26" (3/3) ... [2018-11-28 10:33:26,113 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:26,156 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:26,157 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:33:26,157 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:33:26,157 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:33:26,157 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:26,157 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:26,158 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:33:26,158 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:26,158 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:33:26,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:33:26,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 10:33:26,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:26,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:26,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:33:26,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:26,192 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:33:26,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:33:26,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 10:33:26,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:26,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:26,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:33:26,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:26,201 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L559-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 11#L543-3true [2018-11-28 10:33:26,201 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 5#L547-3true assume !true; 6#L547-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 10#L543-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 11#L543-3true [2018-11-28 10:33:26,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 10:33:26,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-11-28 10:33:26,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:26,318 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-28 10:33:26,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:26,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:33:26,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:33:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 10:33:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:33:26,333 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 10:33:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:26,337 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 10:33:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:33:26,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 10:33:26,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 10:33:26,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-28 10:33:26,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:26,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:33:26,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 10:33:26,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:26,344 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 10:33:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 10:33:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 10:33:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 10:33:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 10:33:26,362 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 10:33:26,363 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 10:33:26,363 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:33:26,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 10:33:26,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 10:33:26,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:26,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:26,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:33:26,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:26,364 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 37#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 40#L543-3 [2018-11-28 10:33:26,364 INFO L796 eck$LassoCheckResult]: Loop: 40#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 39#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 40#L543-3 [2018-11-28 10:33:26,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 10:33:26,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-11-28 10:33:26,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:26,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:26,405 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-28 10:33:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:33:26,406 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:33:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:33:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:33:26,406 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 10:33:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:26,432 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-11-28 10:33:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:33:26,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-11-28 10:33:26,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:33:26,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 10:33:26,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 10:33:26,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:33:26,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 10:33:26,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:26,435 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:33:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 10:33:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 10:33:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 10:33:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 10:33:26,436 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:33:26,436 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:33:26,436 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:33:26,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 10:33:26,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:33:26,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:26,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:26,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:33:26,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:26,437 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 66#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 67#L543-3 [2018-11-28 10:33:26,438 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 68#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 67#L543-3 [2018-11-28 10:33:26,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-28 10:33:26,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-11-28 10:33:26,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-11-28 10:33:26,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:26,653 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-28 10:33:26,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:26,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:26,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:26,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:26,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:26,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:26,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:26,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:26,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-28 10:33:26,840 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:26,840 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:26,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:26,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:27,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:27,247 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-28 10:33:27,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:27,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:27,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:27,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:27,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:27,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:27,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:27,263 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-28 10:33:27,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:27,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:27,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:27,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:27,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:27,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:27,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:27,380 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 10:33:27,380 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 10:33:27,382 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:27,384 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:27,384 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:27,385 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [] [2018-11-28 10:33:27,420 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 10:33:27,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:33:27,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:27,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 10:33:27,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 10:33:27,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-11-28 10:33:27,653 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-28 10:33:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 10:33:27,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2018-11-28 10:33:27,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:27,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-28 10:33:27,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:27,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-28 10:33:27,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:27,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-28 10:33:27,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:27,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-11-28 10:33:27,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:33:27,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 10:33:27,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 10:33:27,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:27,661 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 10:33:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 10:33:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 10:33:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 10:33:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-28 10:33:27,663 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 10:33:27,663 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 10:33:27,664 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:33:27,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-28 10:33:27,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:27,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:27,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:27,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:27,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:33:27,665 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 163#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 167#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 168#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 169#L547-3 [2018-11-28 10:33:27,665 INFO L796 eck$LassoCheckResult]: Loop: 169#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 174#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 171#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 169#L547-3 [2018-11-28 10:33:27,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 10:33:27,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-28 10:33:27,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-28 10:33:27,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,835 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:27,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:27,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:27,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:27,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:27,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:27,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:27,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:27,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 10:33:27,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:27,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:28,172 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:28,172 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-28 10:33:28,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,175 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-28 10:33:28,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,177 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-28 10:33:28,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,179 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-28 10:33:28,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,181 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-28 10:33:28,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,184 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-28 10:33:28,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,186 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-28 10:33:28,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,188 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-28 10:33:28,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,195 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-28 10:33:28,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,198 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-28 10:33:28,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:28,241 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:33:28,241 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 10:33:28,241 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:28,242 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:28,242 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:28,242 INFO L520 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)_2) = -4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 Supporting invariants [] [2018-11-28 10:33:28,260 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 10:33:28,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:33:28,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:28,299 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-28 10:33:28,299 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-28 10:33:28,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 10:33:28,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2018-11-28 10:33:28,323 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-28 10:33:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 10:33:28,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 10:33:28,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 10:33:28,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 10:33:28,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-28 10:33:28,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:28,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-11-28 10:33:28,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:33:28,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 10:33:28,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-28 10:33:28,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:28,327 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 10:33:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-28 10:33:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-11-28 10:33:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 10:33:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 10:33:28,329 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 10:33:28,329 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 10:33:28,329 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:33:28,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 10:33:28,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:28,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:28,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:28,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:28,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:33:28,331 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 279#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 280#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 281#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 284#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 285#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 288#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 277#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 278#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 282#L547-3 [2018-11-28 10:33:28,331 INFO L796 eck$LassoCheckResult]: Loop: 282#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 286#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 283#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 282#L547-3 [2018-11-28 10:33:28,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-11-28 10:33:28,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:33:28,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/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-28 10:33:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:33:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 10:33:28,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:33:28,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-28 10:33:28,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:33:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:33:28,465 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 10:33:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:28,497 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-28 10:33:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:33:28,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-28 10:33:28,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:28,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-28 10:33:28,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 10:33:28,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 10:33:28,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-28 10:33:28,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:28,499 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-28 10:33:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-28 10:33:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-28 10:33:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 10:33:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-28 10:33:28,500 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 10:33:28,500 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 10:33:28,500 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:33:28,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-28 10:33:28,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:28,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:28,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:28,501 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:28,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:33:28,501 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 365#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 367#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 368#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 371#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 374#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 377#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 378#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 380#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 379#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 369#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 370#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 372#L547-3 [2018-11-28 10:33:28,501 INFO L796 eck$LassoCheckResult]: Loop: 372#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 373#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 372#L547-3 [2018-11-28 10:33:28,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,501 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-11-28 10:33:28,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-28 10:33:28,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-11-28 10:33:28,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,789 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2018-11-28 10:33:28,825 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:28,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:28,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:28,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:28,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:28,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:28,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:28,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:28,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 10:33:28,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:28,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:28,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:29,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:29,145 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:29,145 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-28 10:33:29,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:29,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:29,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:29,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,147 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-28 10:33:29,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:29,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:29,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,150 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-28 10:33:29,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:29,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:29,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:29,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,152 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-28 10:33:29,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:29,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:29,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:29,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,153 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-28 10:33:29,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:29,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:29,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,158 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-28 10:33:29,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:29,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:29,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:29,164 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-28 10:33:29,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:29,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:29,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:29,196 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 10:33:29,196 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 10:33:29,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:29,198 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 10:33:29,198 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:29,198 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3, ULTIMATE.start_SelectionSort_~min~0) = 4*ULTIMATE.start_SelectionSort_~array_size + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 - 4*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~min~0 + 1*ULTIMATE.start_SelectionSort_~j~0 - 1 >= 0] [2018-11-28 10:33:29,228 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 10:33:29,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:33:29,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,307 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-28 10:33:29,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 10:33:29,307 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 10:33:29,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 8 states. [2018-11-28 10:33:29,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-28 10:33:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 10:33:29,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:33:29,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,369 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:29,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,431 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-28 10:33:29,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 10:33:29,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 10:33:29,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 43 states and 58 transitions. Complement of second has 9 states. [2018-11-28 10:33:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 10:33:29,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:33:29,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,498 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:29,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,574 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-28 10:33:29,575 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 10:33:29,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 10:33:29,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 7 states. [2018-11-28 10:33:29,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-28 10:33:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-28 10:33:29,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:33:29,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,659 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:29,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,730 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-28 10:33:29,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 10:33:29,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 10:33:29,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 55 transitions. Complement of second has 8 states. [2018-11-28 10:33:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-28 10:33:29,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 10:33:29,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 10:33:29,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 10:33:29,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 55 transitions. [2018-11-28 10:33:29,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:29,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 47 transitions. [2018-11-28 10:33:29,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 10:33:29,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:33:29,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-28 10:33:29,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:29,808 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 10:33:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-28 10:33:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-28 10:33:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 10:33:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-28 10:33:29,811 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-28 10:33:29,811 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-28 10:33:29,811 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 10:33:29,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-11-28 10:33:29,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:29,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:29,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:29,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:29,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:33:29,812 INFO L794 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 883#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 884#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 888#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 889#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 890#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 897#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 899#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 912#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 902#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 908#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 901#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 900#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 886#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 887#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 891#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-11-28 10:33:29,812 INFO L796 eck$LassoCheckResult]: Loop: 896#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 892#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 893#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-11-28 10:33:29,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1907134999, now seen corresponding path program 2 times [2018-11-28 10:33:29,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:29,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:29,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2018-11-28 10:33:29,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:29,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:29,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:29,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1631393568, now seen corresponding path program 3 times [2018-11-28 10:33:29,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:29,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:33:29,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a842b0a-029e-4a39-95ea-d591acc145f5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:33:29,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:33:29,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 10:33:29,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:33:29,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:33:30,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-11-28 10:33:30,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:33:30,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:30,112 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 15 Second operand 17 states. [2018-11-28 10:33:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:30,262 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-28 10:33:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:33:30,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 110 transitions. [2018-11-28 10:33:30,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:30,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 88 transitions. [2018-11-28 10:33:30,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 10:33:30,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 10:33:30,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 88 transitions. [2018-11-28 10:33:30,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:30,265 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-28 10:33:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 88 transitions. [2018-11-28 10:33:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2018-11-28 10:33:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 10:33:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-11-28 10:33:30,267 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-11-28 10:33:30,267 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-11-28 10:33:30,267 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 10:33:30,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2018-11-28 10:33:30,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:33:30,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:30,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:30,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:30,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:33:30,269 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1094#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1095#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1099#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1100#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1101#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1132#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1129#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1126#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1124#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1122#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1120#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1113#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1118#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1112#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1111#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1097#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1098#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1102#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-11-28 10:33:30,269 INFO L796 eck$LassoCheckResult]: Loop: 1107#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1103#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1104#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-11-28 10:33:30,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash -960712718, now seen corresponding path program 3 times [2018-11-28 10:33:30,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:30,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2018-11-28 10:33:30,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1069508453, now seen corresponding path program 4 times [2018-11-28 10:33:30,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:30,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:30,641 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 127 [2018-11-28 10:33:30,689 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:30,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:30,690 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:30,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:30,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:30,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:30,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:30,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:30,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-11-28 10:33:30,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:30,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:30,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:30,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,015 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:31,015 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:31,016 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-28 10:33:31,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,018 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-28 10:33:31,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,021 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-28 10:33:31,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,023 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-28 10:33:31,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,024 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-28 10:33:31,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,026 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-28 10:33:31,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,028 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-28 10:33:31,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,030 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-28 10:33:31,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,032 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-28 10:33:31,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:31,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:31,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:31,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,033 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-28 10:33:31,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,034 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:31,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,035 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:31,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,039 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-28 10:33:31,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,044 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-28 10:33:31,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,047 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-28 10:33:31,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,053 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-28 10:33:31,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:31,055 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-28 10:33:31,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:31,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:31,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:31,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:31,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:31,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:31,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:31,089 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:33:31,090 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 10:33:31,090 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:31,091 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:31,091 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:31,091 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-11-28 10:33:31,133 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 10:33:31,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,178 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-28 10:33:31,178 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-28 10:33:31,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 10:33:31,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-11-28 10:33:31,204 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-28 10:33:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 10:33:31,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-28 10:33:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:31,205 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,247 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-28 10:33:31,248 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-28 10:33:31,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 10:33:31,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-11-28 10:33:31,275 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-28 10:33:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 10:33:31,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-28 10:33:31,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:31,276 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:31,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:31,320 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-28 10:33:31,320 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-28 10:33:31,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 10:33:31,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 66 states and 83 transitions. Complement of second has 6 states. [2018-11-28 10:33:31,344 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-28 10:33:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 10:33:31,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-28 10:33:31,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:31,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 10:33:31,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:31,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-28 10:33:31,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:31,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 83 transitions. [2018-11-28 10:33:31,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:31,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-28 10:33:31,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:33:31,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:33:31,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:33:31,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:31,348 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:31,348 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:31,348 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:31,348 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 10:33:31,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:33:31,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:31,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:33:31,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:33:31 BoogieIcfgContainer [2018-11-28 10:33:31,355 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:33:31,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:31,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:31,356 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:31,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26" (3/4) ... [2018-11-28 10:33:31,360 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:31,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:31,363 INFO L168 Benchmark]: Toolchain (without parser) took 5839.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 945.3 MB in the beginning and 893.8 MB in the end (delta: 51.5 MB). Peak memory consumption was 391.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,364 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 974.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:31,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,366 INFO L168 Benchmark]: Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:31,366 INFO L168 Benchmark]: RCFGBuilder took 193.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,367 INFO L168 Benchmark]: BuchiAutomizer took 5248.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 220.4 MB). Peak memory consumption was 404.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,367 INFO L168 Benchmark]: Witness Printer took 6.97 ms. Allocated memory is still 1.4 GB. Free memory was 901.3 MB in the beginning and 893.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:31,371 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 974.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5248.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 220.4 MB). Peak memory consumption was 404.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.97 ms. Allocated memory is still 1.4 GB. Free memory was 901.3 MB in the beginning and 893.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -4 * j + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function 4 * array_size + unknown-#length-unknown[a] + -4 * min and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 140 SDtfs, 213 SDslu, 95 SDs, 0 SdLazy, 258 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp68 div100 bol100 ite100 ukn100 eq169 hnf84 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...