./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6ac1507c93933134ec25f982abf479335179fe0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:19:55,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:19:55,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:19:55,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:19:55,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:19:55,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:19:55,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:19:55,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:19:55,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:19:55,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:19:55,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:19:55,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:19:55,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:19:55,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:19:55,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:19:55,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:19:55,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:19:55,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:19:55,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:19:55,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:19:55,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:19:55,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:19:55,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:19:55,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:19:55,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:19:55,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:19:55,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:19:55,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:19:55,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:19:55,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:19:55,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:19:55,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:19:55,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:19:55,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:19:55,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:19:55,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:19:55,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:19:55,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:19:55,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:19:55,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:19:55,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:19:55,150 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:19:55,150 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:19:55,150 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:19:55,150 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:19:55,151 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:19:55,151 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:19:55,151 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:19:55,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:19:55,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:19:55,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:19:55,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:19:55,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:19:55,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:19:55,153 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:19:55,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:19:55,153 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:19:55,153 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:19:55,154 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:19:55,154 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ac1507c93933134ec25f982abf479335179fe0d [2018-11-10 09:19:55,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:19:55,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:19:55,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:19:55,190 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:19:55,190 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:19:55,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-10 09:19:55,223 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/data/e4ce7b52e/1a92f034579f4ca49b131637ff9863e8/FLAGdd09bb240 [2018-11-10 09:19:55,619 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:19:55,619 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-10 09:19:55,623 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/data/e4ce7b52e/1a92f034579f4ca49b131637ff9863e8/FLAGdd09bb240 [2018-11-10 09:19:55,634 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/data/e4ce7b52e/1a92f034579f4ca49b131637ff9863e8 [2018-11-10 09:19:55,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:19:55,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:19:55,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:19:55,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:19:55,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:19:55,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e4f871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55, skipping insertion in model container [2018-11-10 09:19:55,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:19:55,658 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:19:55,751 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:19:55,756 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:19:55,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:19:55,775 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:19:55,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55 WrapperNode [2018-11-10 09:19:55,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:19:55,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:19:55,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:19:55,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:19:55,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:19:55,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:19:55,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:19:55,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:19:55,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... [2018-11-10 09:19:55,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:19:55,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:19:55,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:19:55,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:19:55,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:19:55,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:19:55,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:19:55,893 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-11-10 09:19:55,893 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-11-10 09:19:56,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:19:56,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:56 BoogieIcfgContainer [2018-11-10 09:19:56,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:19:56,065 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:19:56,065 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:19:56,068 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:19:56,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:19:56,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:19:55" (1/3) ... [2018-11-10 09:19:56,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bc28754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:19:56, skipping insertion in model container [2018-11-10 09:19:56,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:19:56,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:55" (2/3) ... [2018-11-10 09:19:56,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bc28754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:19:56, skipping insertion in model container [2018-11-10 09:19:56,071 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:19:56,071 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:56" (3/3) ... [2018-11-10 09:19:56,074 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-11-10 09:19:56,111 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:19:56,112 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:19:56,112 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:19:56,112 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:19:56,112 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:19:56,112 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:19:56,112 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:19:56,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:19:56,112 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:19:56,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 09:19:56,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 09:19:56,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:56,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:56,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 09:19:56,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:19:56,146 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:19:56,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 09:19:56,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 09:19:56,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:56,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:56,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 09:19:56,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:19:56,154 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 25#L31true assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 13#L36-4true [2018-11-10 09:19:56,154 INFO L795 eck$LassoCheckResult]: Loop: 13#L36-4true assume true; 19#L36-1true assume !!(main_~i~0 < main_~n~0); 22#L37true SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 32#L37-1true havoc main_#t~nondet9; 15#L36-3true main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 13#L36-4true [2018-11-10 09:19:56,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-10 09:19:56,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:56,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash 39281453, now seen corresponding path program 1 times [2018-11-10 09:19:56,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash 178609258, now seen corresponding path program 1 times [2018-11-10 09:19:56,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:56,435 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:19:56,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:19:56,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:19:56,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:19:56,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:19:56,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:19:56,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:19:56,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:19:56,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-10 09:19:56,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:19:56,437 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:19:56,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:56,774 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:19:56,777 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:19:56,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:56,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:56,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:56,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:56,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:56,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:56,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:56,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:56,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:56,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:56,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,842 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:19:56,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,844 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:19:56,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:56,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:56,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:56,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:56,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:56,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:56,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:56,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:56,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:19:56,940 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 09:19:56,941 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 09:19:56,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:19:56,944 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:19:56,944 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:19:56,944 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_main_~a~0.offset - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:19:56,964 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 09:19:56,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 09:19:56,977 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 09:19:56,977 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 09:19:57,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:57,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:19:57,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 4 states. [2018-11-10 09:19:57,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 9 states. [2018-11-10 09:19:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:19:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:19:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-10 09:19:57,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 09:19:57,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:57,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 09:19:57,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:57,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 09:19:57,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:57,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2018-11-10 09:19:57,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 09:19:57,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 26 states and 31 transitions. [2018-11-10 09:19:57,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 09:19:57,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 09:19:57,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-10 09:19:57,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:57,115 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 09:19:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-10 09:19:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 09:19:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 09:19:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-10 09:19:57,133 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 09:19:57,133 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 09:19:57,134 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:19:57,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-10 09:19:57,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 09:19:57,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:57,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:57,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,135 INFO L793 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 173#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 174#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 175#L36-4 assume true; 179#L36-1 assume !(main_~i~0 < main_~n~0); 163#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 167#selectionSortENTRY [2018-11-10 09:19:57,136 INFO L795 eck$LassoCheckResult]: Loop: 167#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 168#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 176#L14-4 assume !true; 170#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 183#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 184#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 185#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 186#L20-2 havoc #t~mem5; 181#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 162#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 167#selectionSortENTRY [2018-11-10 09:19:57,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 889570328, now seen corresponding path program 1 times [2018-11-10 09:19:57,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:57,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:57,181 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:19:57,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1611941746, now seen corresponding path program 1 times [2018-11-10 09:19:57,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:57,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:57,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:19:57,188 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:19:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:57,191 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 09:19:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:57,214 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-10 09:19:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:57,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-11-10 09:19:57,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 09:19:57,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 33 transitions. [2018-11-10 09:19:57,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 09:19:57,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 09:19:57,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-11-10 09:19:57,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:57,217 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 09:19:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-11-10 09:19:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-10 09:19:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 09:19:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-10 09:19:57,220 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-10 09:19:57,220 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-10 09:19:57,220 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:19:57,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 29 transitions. [2018-11-10 09:19:57,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 09:19:57,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:57,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:57,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,221 INFO L793 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 237#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 238#L36-4 assume true; 241#L36-1 assume !!(main_~i~0 < main_~n~0); 228#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 229#L37-1 havoc main_#t~nondet9; 245#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 242#L36-4 assume true; 243#L36-1 assume !(main_~i~0 < main_~n~0); 225#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 230#selectionSortENTRY [2018-11-10 09:19:57,222 INFO L795 eck$LassoCheckResult]: Loop: 230#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 231#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 239#L14-4 assume true; 232#L14-1 assume !(~index~0 < ~size); 233#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 246#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 247#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 248#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 249#L20-2 havoc #t~mem5; 244#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 226#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 230#selectionSortENTRY [2018-11-10 09:19:57,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -516063598, now seen corresponding path program 1 times [2018-11-10 09:19:57,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -865524682, now seen corresponding path program 1 times [2018-11-10 09:19:57,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:57,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:57,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:57,251 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:19:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:57,251 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 09:19:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:57,284 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-10 09:19:57,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:57,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-10 09:19:57,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 09:19:57,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-11-10 09:19:57,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 09:19:57,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 09:19:57,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-10 09:19:57,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:57,288 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:19:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-10 09:19:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 09:19:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 09:19:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-10 09:19:57,290 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:19:57,290 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:19:57,290 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:19:57,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-11-10 09:19:57,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 09:19:57,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:57,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:57,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,292 INFO L793 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 296#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 297#L36-4 assume true; 301#L36-1 assume !!(main_~i~0 < main_~n~0); 288#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 289#L37-1 havoc main_#t~nondet9; 305#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 302#L36-4 assume true; 303#L36-1 assume !(main_~i~0 < main_~n~0); 285#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 290#selectionSortENTRY [2018-11-10 09:19:57,292 INFO L795 eck$LassoCheckResult]: Loop: 290#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 291#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 298#L14-4 assume true; 292#L14-1 assume !!(~index~0 < ~size); 284#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 287#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 293#L16-2 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 294#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 299#L14-4 assume true; 311#L14-1 assume !(~index~0 < ~size); 310#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 306#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 307#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 308#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 309#L20-2 havoc #t~mem5; 304#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 286#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 290#selectionSortENTRY [2018-11-10 09:19:57,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash -516063598, now seen corresponding path program 2 times [2018-11-10 09:19:57,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -50266226, now seen corresponding path program 1 times [2018-11-10 09:19:57,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:19:57,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1095783709, now seen corresponding path program 1 times [2018-11-10 09:19:57,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:19:57,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:57,408 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:19:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:57,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:19:57,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:19:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-10 09:19:57,649 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 09:19:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:19:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:19:57,729 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 09:19:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:57,773 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-10 09:19:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:19:57,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 44 transitions. [2018-11-10 09:19:57,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 09:19:57,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 40 transitions. [2018-11-10 09:19:57,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 09:19:57,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 09:19:57,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 40 transitions. [2018-11-10 09:19:57,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:57,775 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-10 09:19:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 40 transitions. [2018-11-10 09:19:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-10 09:19:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 09:19:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-10 09:19:57,777 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 09:19:57,777 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 09:19:57,777 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:19:57,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. [2018-11-10 09:19:57,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 09:19:57,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:57,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:57,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:57,778 INFO L793 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 465#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 466#L36-4 assume true; 472#L36-1 assume !!(main_~i~0 < main_~n~0); 485#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 484#L37-1 havoc main_#t~nondet9; 475#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 473#L36-4 assume true; 474#L36-1 assume !!(main_~i~0 < main_~n~0); 457#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 458#L37-1 havoc main_#t~nondet9; 481#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 483#L36-4 assume true; 480#L36-1 assume !(main_~i~0 < main_~n~0); 455#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 459#selectionSortENTRY [2018-11-10 09:19:57,778 INFO L795 eck$LassoCheckResult]: Loop: 459#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 460#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 467#L14-4 assume true; 461#L14-1 assume !!(~index~0 < ~size); 453#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 456#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 462#L16-2 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 463#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 468#L14-4 assume true; 469#L14-1 assume !(~index~0 < ~size); 482#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 478#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 479#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 476#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 477#L20-2 havoc #t~mem5; 470#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 454#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 459#selectionSortENTRY [2018-11-10 09:19:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1962491992, now seen corresponding path program 3 times [2018-11-10 09:19:57,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash -50266226, now seen corresponding path program 2 times [2018-11-10 09:19:57,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:19:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1061394455, now seen corresponding path program 2 times [2018-11-10 09:19:57,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:57,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:19:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:57,970 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 09:19:58,211 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-11-10 09:19:58,330 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:19:58,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:19:58,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:19:58,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:19:58,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:19:58,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:19:58,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:19:58,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:19:58,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-11-10 09:19:58,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:19:58,330 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:19:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:58,563 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:19:58,563 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:19:58,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:58,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:58,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:58,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:58,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:58,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:58,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:58,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:58,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:58,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:58,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:58,628 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:19:58,638 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:19:58,638 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:19:58,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:19:58,639 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:19:58,640 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:19:58,640 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length selectionSort_#in~array.base)_1, selectionSort_#in~startIndex, selectionSort_#in~array.offset) = 1*v_rep(select #length selectionSort_#in~array.base)_1 - 4*selectionSort_#in~startIndex - 1*selectionSort_#in~array.offset Supporting invariants [] [2018-11-10 09:19:58,662 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 09:19:58,663 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 09:19:58,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:58,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:58,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:58,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 09:19:58,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 09:19:58,892 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 86 states and 95 transitions. Complement of second has 15 states. [2018-11-10 09:19:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 09:19:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:19:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-10 09:19:58,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 17 letters. [2018-11-10 09:19:58,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:58,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 33 letters. Loop has 17 letters. [2018-11-10 09:19:58,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:58,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 34 letters. [2018-11-10 09:19:58,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:58,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 95 transitions. [2018-11-10 09:19:58,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 09:19:58,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 72 states and 81 transitions. [2018-11-10 09:19:58,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 09:19:58,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 09:19:58,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 81 transitions. [2018-11-10 09:19:58,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:58,897 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-10 09:19:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 81 transitions. [2018-11-10 09:19:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2018-11-10 09:19:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 09:19:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 09:19:58,899 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 09:19:58,899 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 09:19:58,899 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:19:58,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-10 09:19:58,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:19:58,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:58,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:58,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:58,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:19:58,901 INFO L793 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 735#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 736#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 737#L36-4 assume true; 743#L36-1 assume !!(main_~i~0 < main_~n~0); 757#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 756#L37-1 havoc main_#t~nondet9; 746#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 744#L36-4 assume true; 745#L36-1 assume !!(main_~i~0 < main_~n~0); 727#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 728#L37-1 havoc main_#t~nondet9; 753#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 754#L36-4 assume true; 751#L36-1 assume !(main_~i~0 < main_~n~0); 720#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 723#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 725#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 738#L14-4 [2018-11-10 09:19:58,901 INFO L795 eck$LassoCheckResult]: Loop: 738#L14-4 assume true; 729#L14-1 assume !!(~index~0 < ~size); 717#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 719#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 731#L16-2 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 733#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 738#L14-4 [2018-11-10 09:19:58,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 464162300, now seen corresponding path program 1 times [2018-11-10 09:19:58,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:19:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:58,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1986895017, now seen corresponding path program 1 times [2018-11-10 09:19:58,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:58,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1458995812, now seen corresponding path program 1 times [2018-11-10 09:19:58,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:58,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:58,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:58,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:59,097 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-11-10 09:19:59,260 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-10 09:19:59,289 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:19:59,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:19:59,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:19:59,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:19:59,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:19:59,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:19:59,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:19:59,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:19:59,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-11-10 09:19:59,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:19:59,290 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:19:59,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:19:59,623 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:19:59,623 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:19:59,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:59,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:59,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:59,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:59,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:59,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:59,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:59,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:59,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:59,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:59,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:59,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:59,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:59,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:59,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:59,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:59,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:59,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:59,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:59,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:59,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:59,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:59,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:59,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:59,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:59,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:59,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:59,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:59,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:59,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:19:59,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:59,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:59,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:59,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:19:59,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:19:59,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:19:59,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:19:59,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:19:59,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:19:59,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:19:59,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:19:59,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:19:59,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:19:59,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:19:59,670 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 09:19:59,671 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 09:19:59,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:19:59,672 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:19:59,672 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:19:59,672 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2018-11-10 09:19:59,677 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 09:19:59,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:59,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:59,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:59,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:19:59,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 09:19:59,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 83 states and 96 transitions. Complement of second has 8 states. [2018-11-10 09:19:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:19:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:19:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 09:19:59,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-10 09:19:59,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:59,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-10 09:19:59,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:59,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 12 letters. [2018-11-10 09:19:59,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:19:59,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 96 transitions. [2018-11-10 09:19:59,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:19:59,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 58 states and 65 transitions. [2018-11-10 09:19:59,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 09:19:59,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 09:19:59,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 65 transitions. [2018-11-10 09:19:59,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:19:59,733 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-10 09:19:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 65 transitions. [2018-11-10 09:19:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-11-10 09:19:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 09:19:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 09:19:59,735 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 09:19:59,735 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 09:19:59,736 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:19:59,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2018-11-10 09:19:59,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:19:59,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:19:59,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:19:59,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:59,737 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:19:59,737 INFO L793 eck$LassoCheckResult]: Stem: 978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 971#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 972#L36-4 assume true; 979#L36-1 assume !!(main_~i~0 < main_~n~0); 991#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 990#L37-1 havoc main_#t~nondet9; 982#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 980#L36-4 assume true; 981#L36-1 assume !!(main_~i~0 < main_~n~0); 961#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 962#L37-1 havoc main_#t~nondet9; 988#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 989#L36-4 assume true; 987#L36-1 assume !(main_~i~0 < main_~n~0); 956#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 955#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 957#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 975#L14-4 assume true; 976#L14-1 assume !!(~index~0 < ~size); 992#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 996#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 995#L16-2 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 994#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 993#L14-4 assume true; 964#L14-1 assume !(~index~0 < ~size); 965#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 983#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 984#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 985#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 986#L20-2 havoc #t~mem5; 977#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 951#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 958#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 960#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 973#L14-4 [2018-11-10 09:19:59,737 INFO L795 eck$LassoCheckResult]: Loop: 973#L14-4 assume true; 963#L14-1 assume !!(~index~0 < ~size); 950#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 952#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 966#L16-2 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 968#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 973#L14-4 [2018-11-10 09:19:59,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1615338247, now seen corresponding path program 1 times [2018-11-10 09:19:59,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:19:59,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:59,785 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10d5b7bd-2072-4a33-a30c-13c3f575224d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:19:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:59,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:19:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:19:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-11-10 09:19:59,889 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:19:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1986895017, now seen corresponding path program 2 times [2018-11-10 09:19:59,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:59,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:19:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:19:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:19:59,918 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-10 09:20:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:20:00,065 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-11-10 09:20:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 09:20:00,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 142 transitions. [2018-11-10 09:20:00,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:20:00,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 92 states and 105 transitions. [2018-11-10 09:20:00,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 09:20:00,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 09:20:00,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 105 transitions. [2018-11-10 09:20:00,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:20:00,067 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-11-10 09:20:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 105 transitions. [2018-11-10 09:20:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2018-11-10 09:20:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 09:20:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-11-10 09:20:00,071 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-11-10 09:20:00,071 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-11-10 09:20:00,071 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:20:00,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2018-11-10 09:20:00,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:20:00,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:20:00,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:20:00,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:20:00,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:20:00,073 INFO L793 eck$LassoCheckResult]: Stem: 1290#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 1281#L31 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 1282#L36-4 assume true; 1291#L36-1 assume !!(main_~i~0 < main_~n~0); 1313#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 1301#L37-1 havoc main_#t~nondet9; 1302#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 1292#L36-4 assume true; 1293#L36-1 assume !!(main_~i~0 < main_~n~0); 1266#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 1267#L37-1 havoc main_#t~nondet9; 1294#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 1295#L36-4 assume true; 1306#L36-1 assume !!(main_~i~0 < main_~n~0); 1311#L37 SUMMARY for call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L37 1308#L37-1 havoc main_#t~nondet9; 1307#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := main_#t~post8 + 1;havoc main_#t~post8; 1305#L36-4 assume true; 1300#L36-1 assume !(main_~i~0 < main_~n~0); 1264#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 1268#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1269#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 1326#L14-4 assume true; 1325#L14-1 assume !!(~index~0 < ~size); 1324#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 1323#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 1322#L16-2 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 1321#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 1287#L14-4 assume true; 1288#L14-1 assume !!(~index~0 < ~size); 1263#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 1265#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 1277#L16-2 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 1279#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 1312#L14-4 assume true; 1304#L14-1 assume !(~index~0 < ~size); 1303#L14-5 SUMMARY for call #t~mem4 := read~int(~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L14-5 1296#L19 ~temp~0 := #t~mem4;havoc #t~mem4; 1297#L20 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L20 1298#L20-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~startIndex * 4, 4); srcloc: L20-1 1299#L20-2 havoc #t~mem5; 1289#L21 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L21 1261#L21-1 call selectionSort(~array.base, ~array.offset, ~startIndex + 1, ~size);< 1270#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1271#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := ~startIndex + 1; 1283#L14-4 [2018-11-10 09:20:00,073 INFO L795 eck$LassoCheckResult]: Loop: 1283#L14-4 assume true; 1273#L14-1 assume !!(~index~0 < ~size); 1260#L16 SUMMARY for call #t~mem2 := read~int(~array.base, ~array.offset + ~index~0 * 4, 4); srcloc: L16 1262#L16-1 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + ~minIndex~0 * 4, 4); srcloc: L16-1 1276#L16-2 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 1278#L14-3 #t~post1 := ~index~0;~index~0 := #t~post1 + 1;havoc #t~post1; 1283#L14-4 [2018-11-10 09:20:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1799328427, now seen corresponding path program 2 times [2018-11-10 09:20:00,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:20:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:20:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:20:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1986895017, now seen corresponding path program 3 times [2018-11-10 09:20:00,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:20:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:20:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:20:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -571229443, now seen corresponding path program 1 times [2018-11-10 09:20:00,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:20:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:20:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:20:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:20:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:20:00,349 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2018-11-10 09:20:00,511 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-11-10 09:20:00,695 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-10 09:20:01,016 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-11-10 09:20:01,055 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:20:01,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:20:01,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:20:01,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:20:01,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:20:01,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:20:01,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:20:01,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:20:01,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-10 09:20:01,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:20:01,056 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:20:01,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:20:01,338 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:20:01,338 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:20:01,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:20:01,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:20:01,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:20:01,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:20:01,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:20:01,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,358 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:20:01,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,359 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:20:01,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:20:01,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:20:01,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:20:01,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:20:01,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:20:01,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:20:01,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:20:01,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:20:01,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:20:01,383 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:20:01,398 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 09:20:01,398 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:20:01,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:20:01,399 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:20:01,399 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:20:01,399 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-11-10 09:20:01,416 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 09:20:01,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 09:20:01,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:20:01,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:20:01,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 09:20:01,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 92 states and 104 transitions. Complement of second has 8 states. [2018-11-10 09:20:01,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:20:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:20:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 09:20:01,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 46 letters. Loop has 6 letters. [2018-11-10 09:20:01,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:20:01,503 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:20:01,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:20:01,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:20:01,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 09:20:01,573 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 92 states and 104 transitions. Complement of second has 8 states. [2018-11-10 09:20:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:20:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:20:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 09:20:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 46 letters. Loop has 6 letters. [2018-11-10 09:20:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:20:01,575 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:20:01,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:20:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:20:01,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:20:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:20:01,652 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:20:01,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 09:20:01,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 76 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 102 states and 120 transitions. Complement of second has 7 states. [2018-11-10 09:20:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:20:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:20:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-10 09:20:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 46 letters. Loop has 6 letters. [2018-11-10 09:20:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:20:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 52 letters. Loop has 6 letters. [2018-11-10 09:20:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:20:01,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 46 letters. Loop has 12 letters. [2018-11-10 09:20:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:20:01,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 120 transitions. [2018-11-10 09:20:01,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:20:01,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 0 states and 0 transitions. [2018-11-10 09:20:01,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:20:01,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:20:01,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:20:01,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:20:01,688 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:20:01,688 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:20:01,688 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:20:01,688 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 09:20:01,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:20:01,688 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:20:01,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:20:01,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:20:01 BoogieIcfgContainer [2018-11-10 09:20:01,694 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:20:01,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:20:01,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:20:01,694 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:20:01,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:56" (3/4) ... [2018-11-10 09:20:01,698 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:20:01,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:20:01,698 INFO L168 Benchmark]: Toolchain (without parser) took 6061.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -278.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:20:01,699 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:20:01,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.04 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:20:01,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.82 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:20:01,701 INFO L168 Benchmark]: Boogie Preprocessor took 15.12 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:20:01,701 INFO L168 Benchmark]: RCFGBuilder took 250.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:20:01,702 INFO L168 Benchmark]: BuchiAutomizer took 5628.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.5 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:20:01,702 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:20:01,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.04 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.82 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.12 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5628.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.5 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * a + -4 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * \old(startIndex) + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -1 * index + size and consists of 4 locations. One nondeterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 196 SDtfs, 263 SDslu, 316 SDs, 0 SdLazy, 361 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf99 lsp96 ukn70 mio100 lsp63 div100 bol100 ite100 ukn100 eq158 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...