./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/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_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44846bb6d84d04329b704265dd9929c19b9c8486 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:16:35,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:16:35,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:16:35,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:16:35,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:16:35,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:16:35,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:16:35,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:16:35,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:16:35,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:16:35,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:16:35,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:16:35,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:16:35,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:16:35,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:16:35,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:16:35,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:16:35,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:16:35,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:16:35,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:16:35,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:16:35,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:16:35,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:16:35,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:16:35,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:16:35,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:16:35,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:16:35,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:16:35,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:16:35,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:16:35,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:16:35,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:16:35,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:16:35,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:16:35,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:16:35,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:16:35,332 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 16:16:35,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:16:35,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:16:35,344 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:16:35,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:16:35,344 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 16:16:35,344 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 16:16:35,344 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 16:16:35,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 16:16:35,345 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:16:35,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 16:16:35,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 16:16:35,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 16:16:35,347 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 16:16:35,348 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 16:16:35,348 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_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44846bb6d84d04329b704265dd9929c19b9c8486 [2018-12-08 16:16:35,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:16:35,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:16:35,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:16:35,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:16:35,380 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:16:35,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 16:16:35,412 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/data/ee48c1111/2104f23404624807bd3f48d5975d2722/FLAGed5408623 [2018-12-08 16:16:35,825 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:16:35,825 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/sv-benchmarks/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 16:16:35,832 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/data/ee48c1111/2104f23404624807bd3f48d5975d2722/FLAGed5408623 [2018-12-08 16:16:35,840 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/data/ee48c1111/2104f23404624807bd3f48d5975d2722 [2018-12-08 16:16:35,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:16:35,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:16:35,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:16:35,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:16:35,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:16:35,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:16:35" (1/1) ... [2018-12-08 16:16:35,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:35, skipping insertion in model container [2018-12-08 16:16:35,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:16:35" (1/1) ... [2018-12-08 16:16:35,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:16:35,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:16:36,011 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:16:36,017 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:16:36,076 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:16:36,095 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:16:36,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36 WrapperNode [2018-12-08 16:16:36,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:16:36,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:16:36,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:16:36,096 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:16:36,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:16:36,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:16:36,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:16:36,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:16:36,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... [2018-12-08 16:16:36,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:16:36,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:16:36,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:16:36,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:16:36,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:16:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 16:16:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:16:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:16:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:16:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:16:36,270 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:16:36,270 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:16:36,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:36 BoogieIcfgContainer [2018-12-08 16:16:36,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:16:36,271 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 16:16:36,271 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 16:16:36,273 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 16:16:36,274 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:36,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 04:16:35" (1/3) ... [2018-12-08 16:16:36,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:16:36, skipping insertion in model container [2018-12-08 16:16:36,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:36,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:36" (2/3) ... [2018-12-08 16:16:36,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:16:36, skipping insertion in model container [2018-12-08 16:16:36,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:36,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:36" (3/3) ... [2018-12-08 16:16:36,276 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 16:16:36,306 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 16:16:36,307 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 16:16:36,307 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 16:16:36,307 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 16:16:36,307 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:16:36,307 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:16:36,307 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 16:16:36,307 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:16:36,307 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 16:16:36,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 16:16:36,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 16:16:36,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:36,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:36,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 16:16:36,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 16:16:36,331 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 16:16:36,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 16:16:36,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 16:16:36,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:36,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:36,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 16:16:36,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 16:16:36,337 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L559-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 11#L543-3true [2018-12-08 16:16:36,338 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 5#L547-3true assume !true; 6#L547-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 10#L543-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 11#L543-3true [2018-12-08 16:16:36,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-08 16:16:36,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:36,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-12-08 16:16:36,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:36,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:36,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:16:36,432 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 16:16:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 16:16:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 16:16:36,442 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-08 16:16:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:36,446 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-08 16:16:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 16:16:36,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-08 16:16:36,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 16:16:36,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-12-08 16:16:36,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 16:16:36,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 16:16:36,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-08 16:16:36,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:16:36,452 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 16:16:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-08 16:16:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-08 16:16:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 16:16:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-08 16:16:36,468 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 16:16:36,468 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 16:16:36,469 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 16:16:36,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-08 16:16:36,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 16:16:36,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:36,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:36,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 16:16:36,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 16:16:36,470 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 37#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 40#L543-3 [2018-12-08 16:16:36,470 INFO L796 eck$LassoCheckResult]: Loop: 40#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 39#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 40#L543-3 [2018-12-08 16:16:36,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-08 16:16:36,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-12-08 16:16:36,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:36,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:36,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:16:36,500 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 16:16:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:16:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:36,500 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 16:16:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:36,511 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-08 16:16:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:16:36,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-12-08 16:16:36,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 16:16:36,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-12-08 16:16:36,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 16:16:36,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 16:16:36,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-08 16:16:36,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:16:36,513 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 16:16:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-08 16:16:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-08 16:16:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 16:16:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-08 16:16:36,514 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 16:16:36,514 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 16:16:36,514 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 16:16:36,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-08 16:16:36,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 16:16:36,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:36,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:36,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 16:16:36,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:36,515 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 66#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 67#L543-3 [2018-12-08 16:16:36,516 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 68#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 67#L543-3 [2018-12-08 16:16:36,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-12-08 16:16:36,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-12-08 16:16:36,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-12-08 16:16:36,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:36,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:36,745 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:36,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:36,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:36,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:36,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:36,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:36,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:36,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:36,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 16:16:36,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:36,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:36,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:36,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,086 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:37,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:37,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:37,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:37,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:37,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:37,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:37,189 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 16:16:37,189 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 16:16:37,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:37,191 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:37,192 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:37,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [] [2018-12-08 16:16:37,199 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 16:16:37,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:37,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:37,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 16:16:37,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-08 16:16:37,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-12-08 16:16:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-08 16:16:37,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2018-12-08 16:16:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2018-12-08 16:16:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-08 16:16:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-12-08 16:16:37,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:37,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-12-08 16:16:37,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 16:16:37,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 16:16:37,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-08 16:16:37,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:37,352 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-08 16:16:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-08 16:16:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-08 16:16:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 16:16:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-08 16:16:37,353 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-08 16:16:37,353 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-08 16:16:37,353 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 16:16:37,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-12-08 16:16:37,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:37,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:37,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:37,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 16:16:37,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:37,354 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 163#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 167#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 168#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 169#L547-3 [2018-12-08 16:16:37,354 INFO L796 eck$LassoCheckResult]: Loop: 169#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 174#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 171#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 169#L547-3 [2018-12-08 16:16:37,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-08 16:16:37,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:37,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:37,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-12-08 16:16:37,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-12-08 16:16:37,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,513 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:37,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:37,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:37,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:37,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:37,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:37,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:37,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:37,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-08 16:16:37,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:37,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:37,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:37,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:37,763 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:37,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:37,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:37,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:37,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:37,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:37,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:37,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:37,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:37,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:37,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:37,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:37,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:37,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:37,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:37,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:37,812 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:37,829 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 16:16:37,829 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 16:16:37,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:37,830 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:37,830 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:37,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2018-12-08 16:16:37,847 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 16:16:37,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:37,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:37,874 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:16:37,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 16:16:37,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2018-12-08 16:16:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:16:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-08 16:16:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-08 16:16:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 16:16:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-08 16:16:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:37,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-12-08 16:16:37,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:37,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-12-08 16:16:37,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 16:16:37,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 16:16:37,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-12-08 16:16:37,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:37,897 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 16:16:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-12-08 16:16:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-08 16:16:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 16:16:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-08 16:16:37,899 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 16:16:37,899 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 16:16:37,899 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 16:16:37,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-08 16:16:37,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:37,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:37,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:37,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:37,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:37,900 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 279#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 280#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 281#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 284#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 285#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 288#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 277#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 278#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 282#L547-3 [2018-12-08 16:16:37,901 INFO L796 eck$LassoCheckResult]: Loop: 282#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 286#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 283#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 282#L547-3 [2018-12-08 16:16:37,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-12-08 16:16:37,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:37,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:37,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:16:37,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:16:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:37,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:37,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 16:16:37,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-08 16:16:37,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:16:37,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-12-08 16:16:37,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:38,021 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-08 16:16:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:38,058 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-08 16:16:38,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:16:38,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-12-08 16:16:38,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:38,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-12-08 16:16:38,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 16:16:38,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 16:16:38,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-12-08 16:16:38,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:38,060 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 16:16:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-12-08 16:16:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-08 16:16:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 16:16:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-08 16:16:38,061 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-08 16:16:38,061 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-08 16:16:38,061 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 16:16:38,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-08 16:16:38,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:38,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:38,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:38,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:38,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:38,062 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 365#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 367#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 368#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 371#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 374#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 377#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 378#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 380#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 379#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 369#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 370#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 372#L547-3 [2018-12-08 16:16:38,062 INFO L796 eck$LassoCheckResult]: Loop: 372#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 373#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 372#L547-3 [2018-12-08 16:16:38,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-12-08 16:16:38,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:38,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-12-08 16:16:38,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:38,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:38,086 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-12-08 16:16:38,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:38,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:38,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:38,338 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2018-12-08 16:16:38,381 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:38,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:38,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:38,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:38,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:38,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:38,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:38,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:38,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 16:16:38,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:38,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:38,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:38,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:38,672 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:38,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:38,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:38,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:38,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:38,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:38,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:38,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:38,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:38,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:38,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:38,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:38,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:38,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:38,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:38,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:38,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:38,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:38,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:38,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:38,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:38,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:38,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:38,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:38,700 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:38,713 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 16:16:38,713 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 16:16:38,714 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:38,714 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 16:16:38,714 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:38,714 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~min~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = 4*ULTIMATE.start_SelectionSort_~array_size - 4*ULTIMATE.start_SelectionSort_~min~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~min~0 + 1*ULTIMATE.start_SelectionSort_~j~0 - 1 >= 0] [2018-12-08 16:16:38,735 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-12-08 16:16:38,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:38,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:38,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:38,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:38,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 16:16:38,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:16:38,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 8 states. [2018-12-08 16:16:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 16:16:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-08 16:16:38,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:38,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:38,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:38,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:38,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:38,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:38,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 16:16:38,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:16:38,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 43 states and 58 transitions. Complement of second has 9 states. [2018-12-08 16:16:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-08 16:16:38,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:38,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:38,995 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:39,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:39,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:39,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:39,053 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 16:16:39,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:16:39,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 7 states. [2018-12-08 16:16:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 16:16:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-08 16:16:39,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:39,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:39,109 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:39,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:39,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:39,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:39,170 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 16:16:39,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:16:39,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 55 transitions. Complement of second has 8 states. [2018-12-08 16:16:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-12-08 16:16:39,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:39,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:39,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 16:16:39,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:39,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 16:16:39,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:39,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 55 transitions. [2018-12-08 16:16:39,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:39,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 47 transitions. [2018-12-08 16:16:39,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 16:16:39,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 16:16:39,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-12-08 16:16:39,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:39,230 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-08 16:16:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-12-08 16:16:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-08 16:16:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 16:16:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-12-08 16:16:39,232 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-12-08 16:16:39,232 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-12-08 16:16:39,232 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 16:16:39,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-12-08 16:16:39,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:39,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:39,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:39,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:39,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:39,233 INFO L794 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 883#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 884#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 888#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 889#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 890#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 897#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 899#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 912#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 902#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 908#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 901#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 900#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 886#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 887#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 891#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-12-08 16:16:39,233 INFO L796 eck$LassoCheckResult]: Loop: 896#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 892#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 893#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 896#L549 [2018-12-08 16:16:39,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1907134999, now seen corresponding path program 2 times [2018-12-08 16:16:39,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2018-12-08 16:16:39,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1631393568, now seen corresponding path program 3 times [2018-12-08 16:16:39,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:39,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:16:39,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e018c1e8-abe5-4597-a03a-1033771b5f0c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:16:39,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 16:16:39,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 16:16:39,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 16:16:39,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:39,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 16:16:39,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-12-08 16:16:39,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 16:16:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-08 16:16:39,458 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 15 Second operand 17 states. [2018-12-08 16:16:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:39,622 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-12-08 16:16:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 16:16:39,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 110 transitions. [2018-12-08 16:16:39,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:39,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 88 transitions. [2018-12-08 16:16:39,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-08 16:16:39,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-08 16:16:39,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 88 transitions. [2018-12-08 16:16:39,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:39,624 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-12-08 16:16:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 88 transitions. [2018-12-08 16:16:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2018-12-08 16:16:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 16:16:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-12-08 16:16:39,626 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-08 16:16:39,626 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-08 16:16:39,626 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 16:16:39,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2018-12-08 16:16:39,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:39,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:39,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:39,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:39,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:39,627 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1094#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1095#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1099#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1100#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1101#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1132#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1129#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1126#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1124#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1122#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1120#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1113#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1118#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1112#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1111#L547-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1097#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1098#L543-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1102#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-12-08 16:16:39,627 INFO L796 eck$LassoCheckResult]: Loop: 1107#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1103#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1104#L547-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1107#L549 [2018-12-08 16:16:39,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash -960712718, now seen corresponding path program 3 times [2018-12-08 16:16:39,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2018-12-08 16:16:39,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1069508453, now seen corresponding path program 4 times [2018-12-08 16:16:39,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:39,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:39,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:39,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:39,969 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 127 [2018-12-08 16:16:40,019 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:40,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:40,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:40,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:40,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:40,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:40,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:40,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:40,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-12-08 16:16:40,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:40,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:40,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:40,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:40,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:40,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:40,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:40,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:40,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,340 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 16:16:40,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 16:16:40,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:40,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:16:40,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:40,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:40,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:40,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:40,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:40,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:40,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:40,365 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 16:16:40,365 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 16:16:40,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:40,366 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:40,366 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:40,366 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-12-08 16:16:40,384 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-12-08 16:16:40,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:40,411 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:16:40,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-08 16:16:40,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-12-08 16:16:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-08 16:16:40,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-08 16:16:40,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:40,424 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:40,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:40,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:16:40,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-08 16:16:40,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-12-08 16:16:40,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-08 16:16:40,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-08 16:16:40,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:40,459 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:40,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:40,484 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:16:40,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-08 16:16:40,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 66 states and 83 transitions. Complement of second has 6 states. [2018-12-08 16:16:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:16:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-08 16:16:40,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-08 16:16:40,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:40,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-08 16:16:40,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:40,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2018-12-08 16:16:40,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:40,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 83 transitions. [2018-12-08 16:16:40,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:16:40,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-08 16:16:40,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 16:16:40,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 16:16:40,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 16:16:40,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:16:40,501 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:40,501 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:40,501 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:40,501 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 16:16:40,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 16:16:40,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:16:40,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 16:16:40,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 04:16:40 BoogieIcfgContainer [2018-12-08 16:16:40,507 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 16:16:40,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:16:40,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:16:40,507 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:16:40,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:36" (3/4) ... [2018-12-08 16:16:40,510 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 16:16:40,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:16:40,511 INFO L168 Benchmark]: Toolchain (without parser) took 4669.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 951.7 MB in the beginning and 848.1 MB in the end (delta: 103.6 MB). Peak memory consumption was 273.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:40,511 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:40,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:40,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:40,513 INFO L168 Benchmark]: Boogie Preprocessor took 14.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:40,513 INFO L168 Benchmark]: RCFGBuilder took 136.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:40,513 INFO L168 Benchmark]: BuchiAutomizer took 4235.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 229.6 MB). Peak memory consumption was 291.5 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:40,514 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.2 GB. Free memory is still 848.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:40,516 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 136.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4235.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 229.6 MB). Peak memory consumption was 291.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.2 GB. Free memory is still 848.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. One nondeterministic module has affine ranking function 4 * array_size + -4 * min + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. 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: 3ms 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...