./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/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 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:31:38,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:31:38,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:31:38,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:31:38,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:31:38,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:31:38,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:31:38,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:31:38,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:31:38,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:31:38,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:31:38,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:31:38,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:31:38,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:31:38,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:31:38,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:31:38,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:31:38,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:31:38,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:31:38,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:31:38,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:31:38,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:31:38,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:31:38,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:31:38,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:31:38,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:31:38,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:31:38,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:31:38,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:31:38,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:31:38,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:31:38,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:31:38,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:31:38,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:31:38,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:31:38,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:31:38,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:31:38,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:31:38,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:31:38,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:31:38,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:31:38,581 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 00:31:38,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:31:38,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:31:38,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:31:38,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:31:38,597 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 00:31:38,597 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 00:31:38,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:31:38,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:31:38,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:31:38,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:31:38,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 00:31:38,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 00:31:38,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 00:31:38,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:31:38,599 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 00:31:38,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:31:38,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 00:31:38,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:31:38,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:31:38,600 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 00:31:38,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:31:38,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:31:38,600 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 00:31:38,601 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 00:31:38,601 INFO L138 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/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2019-11-20 00:31:38,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:31:38,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:31:38,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:31:38,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:31:38,784 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:31:38,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-20 00:31:38,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/data/07c81e518/69a869b2c8a34d63bbca18681e9aedf1/FLAG0450756b5 [2019-11-20 00:31:39,278 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:31:39,279 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-20 00:31:39,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/data/07c81e518/69a869b2c8a34d63bbca18681e9aedf1/FLAG0450756b5 [2019-11-20 00:31:39,300 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/data/07c81e518/69a869b2c8a34d63bbca18681e9aedf1 [2019-11-20 00:31:39,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:31:39,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:31:39,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:31:39,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:31:39,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:31:39,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6e7c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39, skipping insertion in model container [2019-11-20 00:31:39,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:31:39,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:31:39,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:31:39,788 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:31:39,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:31:39,879 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:31:39,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39 WrapperNode [2019-11-20 00:31:39,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:31:39,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:31:39,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:31:39,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:31:39,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:31:39,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:31:39,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:31:39,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:31:39,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... [2019-11-20 00:31:39,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:31:39,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:31:39,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:31:39,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:31:39,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/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 [2019-11-20 00:31:40,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:31:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:31:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:31:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:31:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:31:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:31:40,320 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:31:40,321 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 00:31:40,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:40 BoogieIcfgContainer [2019-11-20 00:31:40,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:31:40,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 00:31:40,323 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 00:31:40,326 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 00:31:40,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:31:40,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 12:31:39" (1/3) ... [2019-11-20 00:31:40,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6137ad1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:31:40, skipping insertion in model container [2019-11-20 00:31:40,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:31:40,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:39" (2/3) ... [2019-11-20 00:31:40,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6137ad1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:31:40, skipping insertion in model container [2019-11-20 00:31:40,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:31:40,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:40" (3/3) ... [2019-11-20 00:31:40,332 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2019-11-20 00:31:40,384 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 00:31:40,385 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 00:31:40,385 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 00:31:40,386 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:31:40,386 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:31:40,386 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 00:31:40,387 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:31:40,387 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 00:31:40,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-20 00:31:40,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 00:31:40,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:40,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:40,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 00:31:40,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 00:31:40,432 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 00:31:40,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-20 00:31:40,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 00:31:40,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:40,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:40,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 00:31:40,437 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 00:31:40,444 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#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; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 4#L550-3true [2019-11-20 00:31:40,445 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-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; 12#L554-3true assume !true; 14#L554-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); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2019-11-20 00:31:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-20 00:31:40,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159415621] [2019-11-20 00:31:40,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-11-20 00:31:40,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34396865] [2019-11-20 00:31:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:40,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34396865] [2019-11-20 00:31:40,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:40,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:31:40,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015619278] [2019-11-20 00:31:40,611 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 00:31:40,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:31:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:31:40,626 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-20 00:31:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:40,631 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-20 00:31:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:31:40,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-20 00:31:40,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 00:31:40,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-11-20 00:31:40,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 00:31:40,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 00:31:40,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-20 00:31:40,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:31:40,639 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 00:31:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-20 00:31:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 00:31:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 00:31:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-20 00:31:40,663 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 00:31:40,663 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-20 00:31:40,663 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 00:31:40,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-20 00:31:40,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 00:31:40,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:40,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:40,664 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 00:31:40,665 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 00:31:40,665 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#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; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 37#L550-3 [2019-11-20 00:31:40,665 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-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#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-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); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2019-11-20 00:31:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-20 00:31:40,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086513782] [2019-11-20 00:31:40,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-11-20 00:31:40,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410067933] [2019-11-20 00:31:40,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:40,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410067933] [2019-11-20 00:31:40,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:40,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:31:40,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455563830] [2019-11-20 00:31:40,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 00:31:40,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:40,729 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-20 00:31:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:40,754 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-11-20 00:31:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:40,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-11-20 00:31:40,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 00:31:40,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-11-20 00:31:40,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 00:31:40,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 00:31:40,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-20 00:31:40,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:31:40,758 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-20 00:31:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-20 00:31:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-20 00:31:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-20 00:31:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-20 00:31:40,759 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-20 00:31:40,760 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-20 00:31:40,760 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 00:31:40,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-20 00:31:40,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 00:31:40,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:40,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:40,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 00:31:40,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:40,761 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 66#L550-3 [2019-11-20 00:31:40,762 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-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#L554-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#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-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); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2019-11-20 00:31:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-20 00:31:40,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277382426] [2019-11-20 00:31:40,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,783 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-11-20 00:31:40,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491535009] [2019-11-20 00:31:40,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-11-20 00:31:40,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:40,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46920219] [2019-11-20 00:31:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:40,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:41,067 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-20 00:31:41,265 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-20 00:31:41,336 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:41,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:41,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:41,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:41,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:41,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:41,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:41,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:41,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2019-11-20 00:31:41,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:41,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:41,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,523 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-20 00:31:41,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:41,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:42,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:42,118 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:42,129 INFO L120 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 [2019-11-20 00:31:42,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:42,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:42,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:42,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:42,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:42,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:42,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:42,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:42,156 INFO L120 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 [2019-11-20 00:31:42,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:42,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:42,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:42,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:42,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:42,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:42,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:42,178 INFO L120 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 [2019-11-20 00:31:42,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:42,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:42,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:42,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:42,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:42,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:42,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:42,336 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-20 00:31:42,336 INFO L444 ModelExtractionUtils]: 16 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:42,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:31:42,351 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:31:42,351 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:42,352 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2019-11-20 00:31:42,379 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 00:31:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:42,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:31:42,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:42,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:42,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:31:42,502 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 [2019-11-20 00:31:42,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-20 00:31:42,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-11-20 00:31:42,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 00:31:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-20 00:31:42,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2019-11-20 00:31:42,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2019-11-20 00:31:42,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2019-11-20 00:31:42,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:42,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-20 00:31:42,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:42,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-11-20 00:31:42,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 00:31:42,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 00:31:42,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-20 00:31:42,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:42,551 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-20 00:31:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-20 00:31:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-20 00:31:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 00:31:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-20 00:31:42,553 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-20 00:31:42,553 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-20 00:31:42,553 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 00:31:42,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-20 00:31:42,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:42,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:42,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:42,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 00:31:42,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:42,555 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 157#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 158#L566 assume !(main_~array_size~0 < 1); 159#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 160#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 165#L554-3 [2019-11-20 00:31:42,555 INFO L796 eck$LassoCheckResult]: Loop: 165#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 169#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 166#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 165#L554-3 [2019-11-20 00:31:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-20 00:31:42,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:42,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856217752] [2019-11-20 00:31:42,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-20 00:31:42,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147057687] [2019-11-20 00:31:42,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-20 00:31:42,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:42,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949848025] [2019-11-20 00:31:42,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:42,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:42,803 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 00:31:42,949 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-20 00:31:43,011 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:43,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:43,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:43,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:43,012 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:43,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:43,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:43,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2019-11-20 00:31:43,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:43,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:43,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,200 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-20 00:31:43,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:43,713 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:43,713 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,732 INFO L120 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 [2019-11-20 00:31:43,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:43,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:43,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:43,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,748 INFO L120 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 [2019-11-20 00:31:43,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:43,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:43,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:43,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:43,773 INFO L120 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 [2019-11-20 00:31:43,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:43,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:43,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:43,797 INFO L120 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 [2019-11-20 00:31:43,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:43,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:43,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:43,824 INFO L120 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 [2019-11-20 00:31:43,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:43,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:43,849 INFO L120 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 [2019-11-20 00:31:43,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:43,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,876 INFO L120 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 [2019-11-20 00:31:43,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:43,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:43,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:43,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:43,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:43,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:43,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:43,953 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-20 00:31:43,953 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:43,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:31:43,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:31:43,964 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:43,964 INFO L512 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 [] [2019-11-20 00:31:43,984 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 00:31:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:44,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:31:44,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:44,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:44,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:44,039 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 [2019-11-20 00:31:44,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-20 00:31:44,069 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. [2019-11-20 00:31:44,070 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 [2019-11-20 00:31:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 00:31:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-20 00:31:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 00:31:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 00:31:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:44,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 00:31:44,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:44,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-20 00:31:44,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:44,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-11-20 00:31:44,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 00:31:44,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-20 00:31:44,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-20 00:31:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:44,076 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-20 00:31:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-20 00:31:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-11-20 00:31:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 00:31:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-20 00:31:44,079 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 00:31:44,079 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 00:31:44,079 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 00:31:44,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-20 00:31:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:44,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:44,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:44,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:44,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:44,085 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 269#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 270#L566 assume !(main_~array_size~0 < 1); 271#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 272#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 276#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 282#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 279#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 280#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 283#L554-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); 273#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 274#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 277#L554-3 [2019-11-20 00:31:44,086 INFO L796 eck$LassoCheckResult]: Loop: 277#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 281#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 278#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 277#L554-3 [2019-11-20 00:31:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-11-20 00:31:44,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:44,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346574725] [2019-11-20 00:31:44,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:44,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346574725] [2019-11-20 00:31:44,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193000070] [2019-11-20 00:31:44,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:31:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:44,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:31:44,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:44,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:31:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-20 00:31:44,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236237752] [2019-11-20 00:31:44,280 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 00:31:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-20 00:31:44,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:44,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563214448] [2019-11-20 00:31:44,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:44,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:31:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:31:44,382 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-20 00:31:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:44,442 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-20 00:31:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:31:44,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-20 00:31:44,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:44,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-11-20 00:31:44,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 00:31:44,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 00:31:44,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-11-20 00:31:44,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:44,445 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-20 00:31:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-11-20 00:31:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-11-20 00:31:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 00:31:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-20 00:31:44,447 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-20 00:31:44,447 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-20 00:31:44,447 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 00:31:44,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-20 00:31:44,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:44,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:44,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:44,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:44,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:44,449 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 359#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 360#L566 assume !(main_~array_size~0 < 1); 361#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 362#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 366#L554-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#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 369#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 370#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 372#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 373#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 374#L554-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); 363#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 364#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 367#L554-3 [2019-11-20 00:31:44,449 INFO L796 eck$LassoCheckResult]: Loop: 367#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 371#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 368#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 367#L554-3 [2019-11-20 00:31:44,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-11-20 00:31:44,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:44,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797775700] [2019-11-20 00:31:44,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-20 00:31:44,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:44,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360786325] [2019-11-20 00:31:44,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-11-20 00:31:44,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:44,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681152770] [2019-11-20 00:31:44,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:44,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:44,988 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2019-11-20 00:31:45,071 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:45,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:45,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:45,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:45,072 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:45,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:45,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:45,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2019-11-20 00:31:45,072 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:45,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:45,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:45,728 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,753 INFO L120 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 [2019-11-20 00:31:45,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:45,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:45,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:45,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,802 INFO L120 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 [2019-11-20 00:31:45,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:45,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:45,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:45,839 INFO L120 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 [2019-11-20 00:31:45,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:45,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:45,864 INFO L120 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 [2019-11-20 00:31:45,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:45,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:45,897 INFO L120 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 [2019-11-20 00:31:45,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:45,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:45,938 INFO L120 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 [2019-11-20 00:31:45,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:45,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:45,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:45,956 INFO L120 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 [2019-11-20 00:31:45,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:45,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:45,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:45,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:45,991 INFO L120 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 [2019-11-20 00:31:45,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:45,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:45,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:45,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:46,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:46,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:46,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:46,064 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-20 00:31:46,064 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:46,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:46,076 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 00:31:46,076 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:46,076 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -8*ULTIMATE.start_SelectionSort_~j~0 + 5*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 3 >= 0] [2019-11-20 00:31:46,113 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 00:31:46,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 00:31:46,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:46,269 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-20 00:31:46,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-20 00:31:46,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-20 00:31:46,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 00:31:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-20 00:31:46,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-20 00:31:46,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:46,310 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:46,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-20 00:31:46,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-20 00:31:46,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-20 00:31:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 00:31:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-20 00:31:46,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-20 00:31:46,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:46,494 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:46,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:46,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:46,619 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-20 00:31:46,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-20 00:31:46,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 84 transitions. Complement of second has 15 states. [2019-11-20 00:31:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-20 00:31:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 00:31:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2019-11-20 00:31:46,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-20 00:31:46,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:46,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 00:31:46,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:46,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-20 00:31:46,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:46,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 84 transitions. [2019-11-20 00:31:46,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:46,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 46 transitions. [2019-11-20 00:31:46,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 00:31:46,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 00:31:46,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2019-11-20 00:31:46,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:46,945 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-11-20 00:31:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2019-11-20 00:31:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2019-11-20 00:31:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 00:31:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-20 00:31:46,948 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-20 00:31:46,948 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-20 00:31:46,948 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 00:31:46,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-20 00:31:46,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:46,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:46,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:46,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:46,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:46,951 INFO L794 eck$LassoCheckResult]: Stem: 755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 751#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; 752#L566 assume !(main_~array_size~0 < 1); 753#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 754#L550-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; 756#L554-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); 769#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 760#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 757#L554-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); 762#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 763#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 768#L554-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); 766#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 767#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 765#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 764#L554-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); 749#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 750#L550-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; 758#L554-3 [2019-11-20 00:31:46,951 INFO L796 eck$LassoCheckResult]: Loop: 758#L554-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); 761#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 759#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 758#L554-3 [2019-11-20 00:31:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 661745927, now seen corresponding path program 3 times [2019-11-20 00:31:46,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:46,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151180837] [2019-11-20 00:31:46,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:46,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-20 00:31:46,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:46,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538414746] [2019-11-20 00:31:46,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:46,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash 173047542, now seen corresponding path program 2 times [2019-11-20 00:31:46,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:46,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927661129] [2019-11-20 00:31:46,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:47,042 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:47,572 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2019-11-20 00:31:47,638 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:47,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:47,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:47,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:47,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:47,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:47,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:47,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:47,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration7_Lasso [2019-11-20 00:31:47,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:47,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:47,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,857 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-20 00:31:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:47,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:48,209 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:48,209 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,215 INFO L120 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 [2019-11-20 00:31:48,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,224 INFO L120 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 [2019-11-20 00:31:48,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:48,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:48,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:48,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,232 INFO L120 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 [2019-11-20 00:31:48,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,243 INFO L120 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 [2019-11-20 00:31:48,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:48,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:48,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:48,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:48,260 INFO L120 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 [2019-11-20 00:31:48,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:48,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:48,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,272 INFO L120 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 [2019-11-20 00:31:48,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:48,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:48,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:48,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,290 INFO L120 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 [2019-11-20 00:31:48,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:48,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:48,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:48,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,298 INFO L120 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 [2019-11-20 00:31:48,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,312 INFO L120 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 [2019-11-20 00:31:48,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,328 INFO L120 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 [2019-11-20 00:31:48,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,341 INFO L120 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 [2019-11-20 00:31:48,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:48,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:48,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:48,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:48,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:48,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:48,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:48,396 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-20 00:31:48,397 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:48,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:31:48,429 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 00:31:48,429 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:48,429 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4, ULTIMATE.start_SelectionSort_~min~0) = -1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4 - 4*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-11-20 00:31:48,450 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-20 00:31:48,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 00:31:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:48,557 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 [2019-11-20 00:31:48,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 00:31:48,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2019-11-20 00:31:48,624 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 [2019-11-20 00:31:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-20 00:31:48,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 00:31:48,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:48,625 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:48,706 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 [2019-11-20 00:31:48,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 00:31:48,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-11-20 00:31:48,766 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 [2019-11-20 00:31:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-20 00:31:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 00:31:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:48,766 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:48,854 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 [2019-11-20 00:31:48,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 00:31:48,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2019-11-20 00:31:48,947 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 [2019-11-20 00:31:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-20 00:31:48,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 00:31:48,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:48,948 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:48,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:49,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:49,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:49,037 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 [2019-11-20 00:31:49,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 00:31:49,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 66 transitions. Complement of second has 8 states. [2019-11-20 00:31:49,099 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 [2019-11-20 00:31:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-20 00:31:49,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-20 00:31:49,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:49,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-20 00:31:49,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:49,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-20 00:31:49,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:49,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-20 00:31:49,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:49,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 57 transitions. [2019-11-20 00:31:49,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 00:31:49,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 00:31:49,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-11-20 00:31:49,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:49,103 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-20 00:31:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-11-20 00:31:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-20 00:31:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 00:31:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2019-11-20 00:31:49,106 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-11-20 00:31:49,106 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-11-20 00:31:49,107 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 00:31:49,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2019-11-20 00:31:49,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:49,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:49,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:49,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:49,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:49,109 INFO L794 eck$LassoCheckResult]: Stem: 1361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1355#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; 1356#L566 assume !(main_~array_size~0 < 1); 1357#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 1358#L550-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; 1362#L554-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); 1370#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1372#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1363#L554-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); 1392#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1390#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1386#L554-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); 1376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1385#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1374#L554-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); 1359#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1360#L550-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; 1364#L554-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); 1369#L556 [2019-11-20 00:31:49,109 INFO L796 eck$LassoCheckResult]: Loop: 1369#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1365#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1366#L554-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); 1369#L556 [2019-11-20 00:31:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash -373906704, now seen corresponding path program 3 times [2019-11-20 00:31:49,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:49,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794710633] [2019-11-20 00:31:49,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2019-11-20 00:31:49,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:49,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341165217] [2019-11-20 00:31:49,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2090576807, now seen corresponding path program 4 times [2019-11-20 00:31:49,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:49,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404155435] [2019-11-20 00:31:49,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:49,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:49,681 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 130 [2019-11-20 00:31:49,773 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:49,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:49,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:49,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:49,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:49,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:49,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:49,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:49,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration8_Lasso [2019-11-20 00:31:49,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:49,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:49,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:49,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:49,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:49,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:49,975 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-20 00:31:50,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:50,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:50,383 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,386 INFO L120 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 [2019-11-20 00:31:50,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:50,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:50,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:50,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:50,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:50,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:50,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:50,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,394 INFO L120 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 [2019-11-20 00:31:50,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:50,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:50,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:50,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:50,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:50,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:50,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,403 INFO L120 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 [2019-11-20 00:31:50,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:50,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:50,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:50,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:50,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:50,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:50,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:50,420 INFO L120 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 [2019-11-20 00:31:50,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:50,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:50,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:50,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:50,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:50,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,452 INFO L120 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 [2019-11-20 00:31:50,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:50,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:50,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:50,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:50,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:50,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:50,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:50,542 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-20 00:31:50,543 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:31:50,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:50,550 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 00:31:50,551 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:50,551 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~min~0) = -2*ULTIMATE.start_SelectionSort_~j~0 + 13*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_5 + 16*ULTIMATE.start_SelectionSort_~min~0 >= 0] [2019-11-20 00:31:50,618 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2019-11-20 00:31:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:50,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 00:31:50,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:50,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-20 00:31:50,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:31:50,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:31:50,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:31:50,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-20 00:31:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:50,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 00:31:50,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:50,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-20 00:31:50,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-20 00:31:51,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-11-20 00:31:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 00:31:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-20 00:31:51,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 00:31:51,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:51,032 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:51,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 00:31:51,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:51,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-20 00:31:51,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:31:51,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:31:51,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:31:51,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-20 00:31:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:51,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 00:31:51,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:51,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-20 00:31:51,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-20 00:31:51,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-11-20 00:31:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 00:31:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-20 00:31:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 00:31:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:51,352 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:51,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 00:31:51,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:51,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-20 00:31:51,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:31:51,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:31:51,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:31:51,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-20 00:31:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:51,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 00:31:51,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:51,628 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-20 00:31:51,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-20 00:31:52,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 286 states and 366 transitions. Complement of second has 46 states. [2019-11-20 00:31:52,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 18 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-20 00:31:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 00:31:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 116 transitions. [2019-11-20 00:31:52,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 00:31:52,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:52,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 00:31:52,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:52,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-20 00:31:52,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:52,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 366 transitions. [2019-11-20 00:31:52,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 00:31:52,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 234 states and 310 transitions. [2019-11-20 00:31:52,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-20 00:31:52,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-20 00:31:52,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 310 transitions. [2019-11-20 00:31:52,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:52,544 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 310 transitions. [2019-11-20 00:31:52,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 310 transitions. [2019-11-20 00:31:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 85. [2019-11-20 00:31:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 00:31:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2019-11-20 00:31:52,553 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-11-20 00:31:52,553 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-11-20 00:31:52,553 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 00:31:52,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 119 transitions. [2019-11-20 00:31:52,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:52,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:52,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:52,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:52,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:52,556 INFO L794 eck$LassoCheckResult]: Stem: 2188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2180#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; 2181#L566 assume !(main_~array_size~0 < 1); 2182#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 2183#L550-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; 2184#L554-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); 2244#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2243#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2240#L554-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); 2235#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2233#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#L554-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); 2217#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2230#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2229#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2198#L554-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); 2178#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2179#L550-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; 2193#L554-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); 2194#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2248#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2200#L554-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); 2195#L556 [2019-11-20 00:31:52,556 INFO L796 eck$LassoCheckResult]: Loop: 2195#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2189#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2190#L554-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); 2195#L556 [2019-11-20 00:31:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2090574885, now seen corresponding path program 5 times [2019-11-20 00:31:52,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:52,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782375264] [2019-11-20 00:31:52,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2019-11-20 00:31:52,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:52,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762464017] [2019-11-20 00:31:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1004330414, now seen corresponding path program 6 times [2019-11-20 00:31:52,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:52,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867280647] [2019-11-20 00:31:52,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:52,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867280647] [2019-11-20 00:31:52,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475052813] [2019-11-20 00:31:52,758 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:31:52,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-20 00:31:52,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:31:52,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:31:52,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:52,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:31:52,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-20 00:31:52,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264376711] [2019-11-20 00:31:52,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:52,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 00:31:52,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-20 00:31:52,989 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. cyclomatic complexity: 38 Second operand 21 states. [2019-11-20 00:31:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:53,350 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2019-11-20 00:31:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:31:53,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 192 transitions. [2019-11-20 00:31:53,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:53,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 99 states and 128 transitions. [2019-11-20 00:31:53,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 00:31:53,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 00:31:53,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 128 transitions. [2019-11-20 00:31:53,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:53,355 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 128 transitions. [2019-11-20 00:31:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 128 transitions. [2019-11-20 00:31:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 48. [2019-11-20 00:31:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 00:31:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-11-20 00:31:53,359 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-20 00:31:53,359 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-20 00:31:53,359 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 00:31:53,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2019-11-20 00:31:53,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:53,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:53,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:53,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:53,361 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:53,361 INFO L794 eck$LassoCheckResult]: Stem: 2545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2539#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; 2540#L566 assume !(main_~array_size~0 < 1); 2541#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 2542#L550-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; 2546#L554-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); 2585#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2583#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2580#L554-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); 2579#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2578#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2571#L554-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); 2569#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2567#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2565#L554-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); 2558#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2563#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2557#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2556#L554-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); 2543#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2544#L550-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; 2547#L554-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); 2552#L556 [2019-11-20 00:31:53,362 INFO L796 eck$LassoCheckResult]: Loop: 2552#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2548#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2549#L554-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); 2552#L556 [2019-11-20 00:31:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 85276535, now seen corresponding path program 7 times [2019-11-20 00:31:53,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:53,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547341813] [2019-11-20 00:31:53,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,386 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 3 times [2019-11-20 00:31:53,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:53,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202088793] [2019-11-20 00:31:53,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,392 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2147355200, now seen corresponding path program 8 times [2019-11-20 00:31:53,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:53,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739955001] [2019-11-20 00:31:53,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:53,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:54,012 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2019-11-20 00:31:54,108 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:54,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:54,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:54,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:54,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:54,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:54,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:54,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration10_Lasso [2019-11-20 00:31:54,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:54,108 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:54,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:54,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:54,650 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,655 INFO L120 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 [2019-11-20 00:31:54,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,662 INFO L120 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 [2019-11-20 00:31:54,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,671 INFO L120 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 [2019-11-20 00:31:54,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,678 INFO L120 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 [2019-11-20 00:31:54,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,684 INFO L120 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 [2019-11-20 00:31:54,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,693 INFO L120 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 [2019-11-20 00:31:54,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,699 INFO L120 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 [2019-11-20 00:31:54,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,709 INFO L120 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 [2019-11-20 00:31:54,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,716 INFO L120 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 [2019-11-20 00:31:54,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,731 INFO L120 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 [2019-11-20 00:31:54,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,738 INFO L120 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 [2019-11-20 00:31:54,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,746 INFO L120 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 [2019-11-20 00:31:54,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,763 INFO L120 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 [2019-11-20 00:31:54,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,771 INFO L120 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 [2019-11-20 00:31:54,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,785 INFO L120 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 [2019-11-20 00:31:54,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:31:54,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:31:54,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:31:54,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,792 INFO L120 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 [2019-11-20 00:31:54,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,807 INFO L120 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 [2019-11-20 00:31:54,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:54,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:54,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:54,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:54,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:54,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:54,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:54,875 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-11-20 00:31:54,875 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:54,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:31:54,880 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:31:54,880 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:54,880 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6) = -4*ULTIMATE.start_SelectionSort_~j~0 + 4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6 Supporting invariants [] [2019-11-20 00:31:54,921 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2019-11-20 00:31:54,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 00:31:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:54,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:54,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:54,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:54,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:55,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 00:31:55,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-20 00:31:55,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-11-20 00:31:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 00:31:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 00:31:55,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 00:31:55,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:55,076 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:55,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:55,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:55,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:55,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:55,141 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 00:31:55,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-20 00:31:55,177 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-11-20 00:31:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 00:31:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 00:31:55,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 00:31:55,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:55,179 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:55,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:55,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:55,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:31:55,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:55,262 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 00:31:55,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-20 00:31:55,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 93 states and 116 transitions. Complement of second has 8 states. [2019-11-20 00:31:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-20 00:31:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 00:31:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2019-11-20 00:31:55,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 00:31:55,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:55,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 00:31:55,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:55,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-20 00:31:55,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:55,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 116 transitions. [2019-11-20 00:31:55,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:55,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 71 states and 91 transitions. [2019-11-20 00:31:55,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 00:31:55,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 00:31:55,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 91 transitions. [2019-11-20 00:31:55,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 00:31:55,335 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. [2019-11-20 00:31:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 91 transitions. [2019-11-20 00:31:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-11-20 00:31:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-20 00:31:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2019-11-20 00:31:55,340 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-11-20 00:31:55,340 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-11-20 00:31:55,340 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 00:31:55,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. [2019-11-20 00:31:55,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 00:31:55,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:31:55,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:31:55,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:55,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 00:31:55,342 INFO L794 eck$LassoCheckResult]: Stem: 3222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3216#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; 3217#L566 assume !(main_~array_size~0 < 1); 3218#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 3219#L550-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; 3223#L554-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); 3265#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 3264#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3263#L554-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); 3260#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3258#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3255#L554-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); 3254#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3253#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3249#L554-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); 3247#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3239#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3240#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 3233#L554-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); 3220#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 3221#L550-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; 3224#L554-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); 3229#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 3235#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3234#L554-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); 3232#L556 [2019-11-20 00:31:55,342 INFO L796 eck$LassoCheckResult]: Loop: 3232#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3225#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3226#L554-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); 3232#L556 [2019-11-20 00:31:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2147357122, now seen corresponding path program 9 times [2019-11-20 00:31:55,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:55,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918729965] [2019-11-20 00:31:55,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:55,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 4 times [2019-11-20 00:31:55,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070148485] [2019-11-20 00:31:55,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,375 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1621882265, now seen corresponding path program 10 times [2019-11-20 00:31:55,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:55,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522130982] [2019-11-20 00:31:55,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:55,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:31:56,268 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 162 [2019-11-20 00:31:56,386 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-20 00:31:56,387 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:31:56,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:31:56,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:31:56,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:31:56,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:31:56,388 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:56,388 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:31:56,388 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:31:56,388 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration11_Lasso [2019-11-20 00:31:56,388 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:31:56,388 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:31:56,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,712 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-11-20 00:31:56,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:56,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:31:57,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:31:57,236 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:57,245 INFO L120 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 [2019-11-20 00:31:57,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:57,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:57,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:57,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:57,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:57,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:57,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:57,257 INFO L120 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 [2019-11-20 00:31:57,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:57,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:57,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:57,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:57,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:57,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:57,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:57,266 INFO L120 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 [2019-11-20 00:31:57,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:31:57,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:31:57,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:31:57,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:31:57,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:31:57,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:31:57,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:31:57,322 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 00:31:57,322 INFO L444 ModelExtractionUtils]: 15 out of 40 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59c7b7c4-e900-41e9-ade8-19480cec7023/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:31:57,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:31:57,331 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:31:57,332 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:31:57,332 INFO L512 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 [] [2019-11-20 00:31:57,433 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-11-20 00:31:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:57,513 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 [2019-11-20 00:31:57,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-20 00:31:57,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-11-20 00:31:57,536 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 [2019-11-20 00:31:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-20 00:31:57,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 00:31:57,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:57,537 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:57,589 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 [2019-11-20 00:31:57,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-20 00:31:57,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-11-20 00:31:57,604 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 [2019-11-20 00:31:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-20 00:31:57,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 00:31:57,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:57,605 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 00:31:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:57,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:31:57,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:57,646 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 [2019-11-20 00:31:57,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-20 00:31:57,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 95 states and 116 transitions. Complement of second has 6 states. [2019-11-20 00:31:57,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 00:31:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:31:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-20 00:31:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 00:31:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-20 00:31:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-20 00:31:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:31:57,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 116 transitions. [2019-11-20 00:31:57,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 00:31:57,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 0 states and 0 transitions. [2019-11-20 00:31:57,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 00:31:57,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 00:31:57,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 00:31:57,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:31:57,665 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:31:57,666 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:31:57,666 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:31:57,666 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 00:31:57,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:31:57,666 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 00:31:57,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 00:31:57,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 12:31:57 BoogieIcfgContainer [2019-11-20 00:31:57,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 00:31:57,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:31:57,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:31:57,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:31:57,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:40" (3/4) ... [2019-11-20 00:31:57,675 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:31:57,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:31:57,677 INFO L168 Benchmark]: Toolchain (without parser) took 18373.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 255.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:57,677 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:31:57,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 947.4 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:57,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:57,678 INFO L168 Benchmark]: Boogie Preprocessor took 34.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:31:57,678 INFO L168 Benchmark]: RCFGBuilder took 365.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:57,679 INFO L168 Benchmark]: BuchiAutomizer took 17348.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -766.1 kB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:57,679 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:31:57,681 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 947.4 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 365.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17348.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -766.1 kB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 11 terminating modules (4 trivial, 2 deterministic, 5 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -8 * j + 5 * unknown-#length-unknown[a] and consists of 12 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * min and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 13 * min and consists of 22 locations. One nondeterministic module has affine ranking function -4 * j + 4 * i + unknown-#length-unknown[a] and consists of 6 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 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 12 iterations. TraceHistogramMax:6. Analysis of lassos took 12.3s. Construction of modules took 0.6s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 246 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 4, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 219 SDtfs, 519 SDslu, 251 SDs, 0 SdLazy, 576 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax108 hnf99 lsp88 ukn73 mio100 lsp66 div100 bol100 ite100 ukn100 eq170 hnf83 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...