./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/eureka_05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34e145a8c3496c7a6f8cda2178ee26349d80aa46 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:26:19,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:26:19,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:26:19,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:26:19,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:26:19,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:26:19,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:26:19,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:26:19,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:26:19,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:26:19,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:26:19,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:26:19,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:26:19,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:26:19,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:26:19,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:26:19,492 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:26:19,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:26:19,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:26:19,496 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:26:19,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:26:19,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:26:19,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:26:19,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:26:19,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:26:19,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:26:19,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:26:19,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:26:19,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:26:19,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:26:19,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:26:19,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:26:19,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:26:19,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:26:19,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:26:19,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:26:19,505 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:26:19,516 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:26:19,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:26:19,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:26:19,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:26:19,517 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:26:19,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:26:19,517 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:26:19,517 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:26:19,517 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:26:19,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:26:19,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:26:19,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:26:19,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:26:19,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:26:19,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:26:19,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:26:19,520 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:26:19,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:26:19,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:26:19,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:26:19,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:26:19,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:26:19,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:26:19,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:26:19,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:26:19,521 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:26:19,522 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_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34e145a8c3496c7a6f8cda2178ee26349d80aa46 [2018-11-18 15:26:19,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:26:19,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:26:19,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:26:19,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:26:19,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:26:19,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-18 15:26:19,603 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/data/aa9ee393d/c4ca89ed546c4e7f972fd35b03fa50ed/FLAGa3dea07d8 [2018-11-18 15:26:20,017 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:26:20,018 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/sv-benchmarks/c/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-18 15:26:20,023 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/data/aa9ee393d/c4ca89ed546c4e7f972fd35b03fa50ed/FLAGa3dea07d8 [2018-11-18 15:26:20,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/data/aa9ee393d/c4ca89ed546c4e7f972fd35b03fa50ed [2018-11-18 15:26:20,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:26:20,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:26:20,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:26:20,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:26:20,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:26:20,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53518e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20, skipping insertion in model container [2018-11-18 15:26:20,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:26:20,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:26:20,175 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:26:20,181 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:26:20,193 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:26:20,206 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:26:20,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20 WrapperNode [2018-11-18 15:26:20,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:26:20,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:26:20,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:26:20,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:26:20,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:26:20,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:26:20,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:26:20,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:26:20,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... [2018-11-18 15:26:20,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:26:20,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:26:20,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:26:20,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:26:20,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/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-18 15:26:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:26:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:26:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:26:20,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:26:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:26:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:26:20,477 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:26:20,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:26:20 BoogieIcfgContainer [2018-11-18 15:26:20,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:26:20,478 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:26:20,478 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:26:20,480 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:26:20,481 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:26:20,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:26:20" (1/3) ... [2018-11-18 15:26:20,482 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@605ceba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:26:20, skipping insertion in model container [2018-11-18 15:26:20,482 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:26:20,482 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:20" (2/3) ... [2018-11-18 15:26:20,482 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@605ceba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:26:20, skipping insertion in model container [2018-11-18 15:26:20,482 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:26:20,482 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:26:20" (3/3) ... [2018-11-18 15:26:20,484 INFO L375 chiAutomizerObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-18 15:26:20,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:26:20,521 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:26:20,521 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:26:20,521 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:26:20,521 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:26:20,521 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:26:20,521 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:26:20,521 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:26:20,521 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:26:20,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-18 15:26:20,543 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 15:26:20,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:20,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:20,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:26:20,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:26:20,547 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:26:20,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-18 15:26:20,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 15:26:20,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:20,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:20,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:26:20,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:26:20,554 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 6#L33-4true [2018-11-18 15:26:20,554 INFO L796 eck$LassoCheckResult]: Loop: 6#L33-4true assume true; 24#L33-1true assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 8#L33-3true main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 6#L33-4true [2018-11-18 15:26:20,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:26:20,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:20,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:20,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 15:26:20,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 15:26:20,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:20,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:26:20,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:26:20,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:26:20,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:26:20,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:26:20,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:26:20,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:26:20,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:26:20,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 15:26:20,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:26:20,819 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:26:20,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:20,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:20,853 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-18 15:26:20,857 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-18 15:26:20,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:20,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:20,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:20,868 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-18 15:26:20,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:26:21,028 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:26:21,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:26:21,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:26:21,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:26:21,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:26:21,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:26:21,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,036 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-18 15:26:21,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:26:21,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:26:21,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:26:21,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,038 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-18 15:26:21,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,045 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-18 15:26:21,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,054 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-18 15:26:21,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:26:21,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:26:21,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:26:21,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,057 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-18 15:26:21,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,065 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-18 15:26:21,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,071 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-18 15:26:21,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:26:21,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:26:21,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:26:21,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,074 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-18 15:26:21,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,085 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-18 15:26:21,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:26:21,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:26:21,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:26:21,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:26:21,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:26:21,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:26:21,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:26:21,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:26:21,118 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:26:21,141 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 15:26:21,141 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:26:21,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:26:21,146 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:26:21,146 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:26:21,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = 2*ULTIMATE.start_main_~i~1 + 1 Supporting invariants [] [2018-11-18 15:26:21,162 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 15:26:21,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:21,213 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-18 15:26:21,226 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-18 15:26:21,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-11-18 15:26:21,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 58 states and 79 transitions. Complement of second has 8 states. [2018-11-18 15:26:21,275 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-18 15:26:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:26:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 15:26:21,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 15:26:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:26:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 15:26:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:26:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 15:26:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:26:21,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 79 transitions. [2018-11-18 15:26:21,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 15:26:21,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 23 states and 29 transitions. [2018-11-18 15:26:21,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 15:26:21,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 15:26:21,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-18 15:26:21,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:21,288 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-18 15:26:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-18 15:26:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 15:26:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 15:26:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-18 15:26:21,311 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-18 15:26:21,311 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-18 15:26:21,311 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:26:21,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-18 15:26:21,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 15:26:21,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:21,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:21,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:26:21,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:21,313 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 152#L33-4 assume true; 154#L33-1 assume !(main_~i~1 >= 0); 150#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 140#L19-4 [2018-11-18 15:26:21,313 INFO L796 eck$LassoCheckResult]: Loop: 140#L19-4 assume true; 141#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 148#L21-4 assume true; 149#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 147#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 146#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 140#L19-4 [2018-11-18 15:26:21,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 15:26:21,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,342 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-18 15:26:21,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:21,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:21,344 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:26:21,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 1 times [2018-11-18 15:26:21,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:21,430 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-18 15:26:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:21,441 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-18 15:26:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:21,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-18 15:26:21,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 28 transitions. [2018-11-18 15:26:21,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 15:26:21,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 15:26:21,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-18 15:26:21,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:21,444 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 15:26:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-18 15:26:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-18 15:26:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 15:26:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-18 15:26:21,446 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 15:26:21,446 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 15:26:21,446 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:26:21,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-18 15:26:21,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:21,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:21,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:21,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:21,448 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 205#L33-4 assume true; 206#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 209#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 207#L33-4 assume true; 208#L33-1 assume !(main_~i~1 >= 0); 203#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 193#L19-4 [2018-11-18 15:26:21,448 INFO L796 eck$LassoCheckResult]: Loop: 193#L19-4 assume true; 194#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 201#L21-4 assume true; 202#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 199#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 200#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 193#L19-4 [2018-11-18 15:26:21,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 15:26:21,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,477 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-18 15:26:21,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:21,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/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-18 15:26:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:21,502 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-18 15:26:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-18 15:26:21,518 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:26:21,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 2 times [2018-11-18 15:26:21,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:26:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:26:21,607 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 15:26:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:21,623 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 15:26:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:26:21,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-18 15:26:21,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 31 transitions. [2018-11-18 15:26:21,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 15:26:21,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 15:26:21,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-18 15:26:21,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:21,625 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 15:26:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-18 15:26:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-18 15:26:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 15:26:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 15:26:21,627 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 15:26:21,627 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 15:26:21,627 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:26:21,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-18 15:26:21,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:21,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:21,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-18 15:26:21,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:21,628 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 283#L33-4 assume true; 284#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 287#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 285#L33-4 assume true; 286#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 292#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 295#L33-4 assume true; 291#L33-1 assume !(main_~i~1 >= 0); 281#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 271#L19-4 [2018-11-18 15:26:21,628 INFO L796 eck$LassoCheckResult]: Loop: 271#L19-4 assume true; 272#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 279#L21-4 assume true; 280#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 277#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 278#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 271#L19-4 [2018-11-18 15:26:21,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1692719029, now seen corresponding path program 2 times [2018-11-18 15:26:21,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:21,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:21,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/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-18 15:26:21,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:21,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:21,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:21,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:21,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:21,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 15:26:21,706 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:26:21,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 3 times [2018-11-18 15:26:21,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:26:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:26:21,778 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 15:26:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:21,802 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-18 15:26:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:26:21,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-18 15:26:21,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 34 transitions. [2018-11-18 15:26:21,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 15:26:21,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 15:26:21,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-11-18 15:26:21,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:21,810 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 15:26:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-11-18 15:26:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-18 15:26:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 15:26:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 15:26:21,812 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 15:26:21,812 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 15:26:21,812 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:26:21,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-11-18 15:26:21,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:21,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:21,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:21,813 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2018-11-18 15:26:21,813 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:21,813 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 377#L33-4 assume true; 378#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 381#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 379#L33-4 assume true; 380#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 392#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 391#L33-4 assume true; 389#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 390#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 388#L33-4 assume true; 385#L33-1 assume !(main_~i~1 >= 0); 375#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 365#L19-4 [2018-11-18 15:26:21,813 INFO L796 eck$LassoCheckResult]: Loop: 365#L19-4 assume true; 366#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 373#L21-4 assume true; 374#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 371#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 372#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 365#L19-4 [2018-11-18 15:26:21,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 3 times [2018-11-18 15:26:21,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:21,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:21,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:21,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:26:21,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 15:26:21,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:21,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 15:26:21,889 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:26:21,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 4 times [2018-11-18 15:26:21,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:26:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:26:21,965 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 15:26:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:22,002 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-18 15:26:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:26:22,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-11-18 15:26:22,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:22,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 37 transitions. [2018-11-18 15:26:22,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 15:26:22,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 15:26:22,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-18 15:26:22,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:22,003 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 15:26:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-18 15:26:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-18 15:26:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 15:26:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-18 15:26:22,005 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:26:22,005 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:26:22,005 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:26:22,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-18 15:26:22,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:22,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:22,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:22,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2018-11-18 15:26:22,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:22,007 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 487#L33-4 assume true; 488#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 505#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 489#L33-4 assume true; 490#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 491#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 492#L33-4 assume true; 504#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 503#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 502#L33-4 assume true; 500#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 501#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 499#L33-4 assume true; 495#L33-1 assume !(main_~i~1 >= 0); 485#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 475#L19-4 [2018-11-18 15:26:22,007 INFO L796 eck$LassoCheckResult]: Loop: 475#L19-4 assume true; 476#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 483#L21-4 assume true; 484#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 481#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 482#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 475#L19-4 [2018-11-18 15:26:22,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 4 times [2018-11-18 15:26:22,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:22,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:22,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:26:22,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:26:22,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:22,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:22,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:22,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-18 15:26:22,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:26:22,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 5 times [2018-11-18 15:26:22,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:26:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:26:22,141 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-18 15:26:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:22,180 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-18 15:26:22,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:26:22,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 60 transitions. [2018-11-18 15:26:22,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:22,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 59 transitions. [2018-11-18 15:26:22,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 15:26:22,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 15:26:22,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-11-18 15:26:22,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:22,182 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-18 15:26:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-11-18 15:26:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-11-18 15:26:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 15:26:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 15:26:22,184 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 15:26:22,184 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 15:26:22,184 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:26:22,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-11-18 15:26:22,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:22,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:22,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:22,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1] [2018-11-18 15:26:22,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:26:22,185 INFO L794 eck$LassoCheckResult]: Stem: 640#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 632#L33-4 assume true; 633#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 653#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 634#L33-4 assume true; 635#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 636#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 637#L33-4 assume true; 652#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 651#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 650#L33-4 assume true; 649#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 648#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 647#L33-4 assume true; 645#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 646#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 644#L33-4 assume true; 641#L33-1 assume !(main_~i~1 >= 0); 630#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 620#L19-4 [2018-11-18 15:26:22,185 INFO L796 eck$LassoCheckResult]: Loop: 620#L19-4 assume true; 621#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 628#L21-4 assume true; 629#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 626#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 627#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 620#L19-4 [2018-11-18 15:26:22,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1041220151, now seen corresponding path program 5 times [2018-11-18 15:26:22,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1513654315, now seen corresponding path program 6 times [2018-11-18 15:26:22,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:22,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 405098483, now seen corresponding path program 1 times [2018-11-18 15:26:22,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:26:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:26:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:26:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:26:22,310 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 15:26:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:22,334 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 15:26:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:26:22,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-11-18 15:26:22,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 15:26:22,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 15:26:22,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 15:26:22,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 15:26:22,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2018-11-18 15:26:22,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:26:22,336 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 15:26:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2018-11-18 15:26:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-18 15:26:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 15:26:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-18 15:26:22,338 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 15:26:22,338 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 15:26:22,338 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:26:22,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2018-11-18 15:26:22,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:26:22,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:26:22,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:26:22,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:22,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:26:22,340 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 734#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 726#L33-4 assume true; 727#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 749#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 728#L33-4 assume true; 729#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 730#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 731#L33-4 assume true; 748#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 747#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 746#L33-4 assume true; 745#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 744#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 743#L33-4 assume true; 741#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 742#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 740#L33-4 assume true; 736#L33-1 assume !(main_~i~1 >= 0); 723#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 712#L19-4 assume true; 713#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 725#L21-4 assume true; 732#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 733#L22 [2018-11-18 15:26:22,340 INFO L796 eck$LassoCheckResult]: Loop: 733#L22 assume SelectionSort_#t~mem2 < SelectionSort_#t~mem3;havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3;SelectionSort_~rh~0 := SelectionSort_~i~0; 724#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 721#L21-4 assume true; 722#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 733#L22 [2018-11-18 15:26:22,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1331420557, now seen corresponding path program 1 times [2018-11-18 15:26:22,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2096906, now seen corresponding path program 1 times [2018-11-18 15:26:22,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:26:22,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1540777860, now seen corresponding path program 1 times [2018-11-18 15:26:22,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:22,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 15:26:22,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:22,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:22,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:22,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 15:26:22,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 15:26:22,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 15:26:22,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:26:22,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2018-11-18 15:26:22,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:26:22,637 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:17, output treesize:33 [2018-11-18 15:26:22,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-18 15:26:22,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:26:22,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 15:26:22,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:11 [2018-11-18 15:26:22,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2018-11-18 15:26:22,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 15:26:22,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:26:22,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:26:22,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-18 15:26:46,722 WARN L180 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 15:26:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-18 15:26:46,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 15:26:46,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:46,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:26:46,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:26:46,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-11-18 15:26:58,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-18 15:26:58,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 15:26:58,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:26:58,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:26:58,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:26:58,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-11-18 15:27:10,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-18 15:27:10,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 15:27:10,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:27:10,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:27:10,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:27:10,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-11-18 15:27:22,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-18 15:27:22,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 15:27:22,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:27:22,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:27:22,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 15:27:22,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2018-11-18 15:28:34,963 WARN L180 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 15:28:34,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-18 15:28:34,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-18 15:28:34,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:28:34,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:28:35,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 15:28:35,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:55, output treesize:21 [2018-11-18 15:28:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:28:35,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:28:35,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 15:28:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:28:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=71, Unknown=6, NotChecked=0, Total=110 [2018-11-18 15:28:35,077 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-18 15:30:59,216 WARN L180 SmtUtils]: Spent 24.03 s on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-18 15:32:35,306 WARN L180 SmtUtils]: Spent 48.05 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-11-18 15:33:23,379 WARN L180 SmtUtils]: Spent 48.06 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-18 15:33:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:33:23,393 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-18 15:33:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:33:23,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2018-11-18 15:33:23,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:23,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 41 transitions. [2018-11-18 15:33:23,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 15:33:23,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 15:33:23,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 41 transitions. [2018-11-18 15:33:23,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:23,395 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 15:33:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 41 transitions. [2018-11-18 15:33:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-18 15:33:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 15:33:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-18 15:33:23,397 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 15:33:23,397 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 15:33:23,397 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:33:23,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2018-11-18 15:33:23,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:23,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:23,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:23,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:23,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:33:23,398 INFO L794 eck$LassoCheckResult]: Stem: 914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 907#L33-4 assume true; 908#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 911#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 909#L33-4 assume true; 910#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 930#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 929#L33-4 assume true; 928#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 927#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 926#L33-4 assume true; 925#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 924#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 923#L33-4 assume true; 921#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 922#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 920#L33-4 assume true; 915#L33-1 assume !(main_~i~1 >= 0); 904#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 893#L19-4 assume true; 894#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 902#L21-4 assume true; 903#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 912#L22 [2018-11-18 15:33:23,398 INFO L796 eck$LassoCheckResult]: Loop: 912#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 905#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 906#L21-4 assume true; 919#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 912#L22 [2018-11-18 15:33:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1331420557, now seen corresponding path program 2 times [2018-11-18 15:33:23,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:23,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2156488, now seen corresponding path program 1 times [2018-11-18 15:33:23,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:23,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:23,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1540718278, now seen corresponding path program 1 times [2018-11-18 15:33:23,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:24,235 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2018-11-18 15:33:24,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:33:24,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:33:24,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:33:24,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:33:24,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:33:24,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:33:24,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:33:24,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:33:24,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_05_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-18 15:33:24,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:33:24,311 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:33:24,314 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-18 15:33:24,315 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-18 15:33:24,322 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-18 15:33:24,323 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-18 15:33:24,324 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-18 15:33:24,325 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-18 15:33:24,326 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-18 15:33:24,327 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-18 15:33:24,328 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-18 15:33:24,330 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-18 15:33:24,331 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-18 15:33:24,332 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-18 15:33:24,591 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:33:24,591 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:33:24,592 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-18 15:33:24,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,593 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-18 15:33:24,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:33:24,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:33:24,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,596 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-18 15:33:24,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,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-18 15:33:24,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,598 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-18 15:33:24,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,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-18 15:33:24,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,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-18 15:33:24,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,601 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-18 15:33:24,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,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-18 15:33:24,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,603 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-18 15:33:24,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:33:24,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:33:24,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:33:24,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,605 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-18 15:33:24,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:33:24,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:33:24,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,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-18 15:33:24,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:33:24,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:33:24,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:33:24,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,611 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-18 15:33:24,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:33:24,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:33:24,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:33:24,617 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-18 15:33:24,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:33:24,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:33:24,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:33:24,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:33:24,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:33:24,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:33:24,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:33:24,647 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:33:24,648 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:33:24,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:33:24,650 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:33:24,650 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:33:24,650 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~#array~0.offset, ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ~#array~0.base)_2) = -1*~#array~0.offset - 4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ~#array~0.base)_2 Supporting invariants [] [2018-11-18 15:33:24,684 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 15:33:24,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:33:24,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:24,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:24,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:24,728 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-18 15:33:24,729 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-18 15:33:24,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 15:33:24,752 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 66 states and 73 transitions. Complement of second has 7 states. [2018-11-18 15:33:24,752 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-18 15:33:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:33:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 15:33:24,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 4 letters. [2018-11-18 15:33:24,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:33:24,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-18 15:33:24,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:33:24,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-18 15:33:24,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:33:24,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2018-11-18 15:33:24,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-18 15:33:24,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 56 states and 62 transitions. [2018-11-18 15:33:24,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 15:33:24,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-18 15:33:24,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2018-11-18 15:33:24,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:24,756 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-18 15:33:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2018-11-18 15:33:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-11-18 15:33:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:33:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-18 15:33:24,759 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-18 15:33:24,759 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-18 15:33:24,759 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:33:24,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2018-11-18 15:33:24,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:24,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:24,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:24,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:24,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:33:24,760 INFO L794 eck$LassoCheckResult]: Stem: 1145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 1144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 1137#L33-4 assume true; 1138#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1141#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1139#L33-4 assume true; 1140#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1165#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1164#L33-4 assume true; 1163#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1162#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1161#L33-4 assume true; 1160#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1159#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1158#L33-4 assume true; 1152#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1155#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1151#L33-4 assume true; 1146#L33-1 assume !(main_~i~1 >= 0); 1133#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 1134#L19-4 assume true; 1157#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1156#L21-4 assume true; 1154#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1153#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1148#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1166#L21-4 assume true; 1142#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1127#L21-5 [2018-11-18 15:33:24,760 INFO L796 eck$LassoCheckResult]: Loop: 1127#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1128#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 1121#L19-4 assume true; 1122#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1129#L21-4 assume true; 1130#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1127#L21-5 [2018-11-18 15:33:24,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1540718280, now seen corresponding path program 1 times [2018-11-18 15:33:24,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:24,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:33:24,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:33:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:24,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:24,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:33:24,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-18 15:33:24,889 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:33:24,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2045542101, now seen corresponding path program 7 times [2018-11-18 15:33:24,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:24,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:33:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:33:24,949 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-18 15:33:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:33:24,984 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-18 15:33:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:33:24,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-11-18 15:33:24,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:24,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 54 states and 59 transitions. [2018-11-18 15:33:24,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 15:33:24,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 15:33:24,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 59 transitions. [2018-11-18 15:33:24,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:24,985 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-18 15:33:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 59 transitions. [2018-11-18 15:33:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-18 15:33:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:33:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-18 15:33:24,987 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-18 15:33:24,987 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-18 15:33:24,987 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:33:24,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2018-11-18 15:33:24,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:24,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:24,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:24,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:24,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:33:24,988 INFO L794 eck$LassoCheckResult]: Stem: 1347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 1346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 1338#L33-4 assume true; 1339#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1342#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1340#L33-4 assume true; 1341#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1363#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1362#L33-4 assume true; 1361#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1360#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1359#L33-4 assume true; 1358#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1357#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1356#L33-4 assume true; 1354#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1355#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1353#L33-4 assume true; 1348#L33-1 assume !(main_~i~1 >= 0); 1334#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 1321#L19-4 assume true; 1322#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1335#L21-4 assume true; 1343#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1344#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1337#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1332#L21-4 assume true; 1333#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1345#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1336#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1330#L21-4 assume true; 1331#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1327#L21-5 [2018-11-18 15:33:24,988 INFO L796 eck$LassoCheckResult]: Loop: 1327#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1328#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 1329#L19-4 assume true; 1351#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1352#L21-4 assume true; 1364#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1327#L21-5 [2018-11-18 15:33:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1673124737, now seen corresponding path program 2 times [2018-11-18 15:33:24,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:24,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:24,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:24,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:25,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:33:25,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:33:25,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:33:25,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:33:25,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:33:25,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:25,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:33:25,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-18 15:33:25,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:33:25,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2045542101, now seen corresponding path program 8 times [2018-11-18 15:33:25,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:33:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:33:25,163 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-11-18 15:33:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:33:25,233 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-18 15:33:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:33:25,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 66 transitions. [2018-11-18 15:33:25,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:25,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 63 transitions. [2018-11-18 15:33:25,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 15:33:25,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 15:33:25,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 63 transitions. [2018-11-18 15:33:25,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:25,235 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-18 15:33:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 63 transitions. [2018-11-18 15:33:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-11-18 15:33:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 15:33:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-18 15:33:25,238 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-18 15:33:25,238 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-18 15:33:25,238 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 15:33:25,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2018-11-18 15:33:25,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:25,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:25,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:25,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:25,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:33:25,239 INFO L794 eck$LassoCheckResult]: Stem: 1566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 1565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 1558#L33-4 assume true; 1559#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1562#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1560#L33-4 assume true; 1561#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1584#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1583#L33-4 assume true; 1582#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1581#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1580#L33-4 assume true; 1579#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1578#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1577#L33-4 assume true; 1575#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1576#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1574#L33-4 assume true; 1567#L33-1 assume !(main_~i~1 >= 0); 1554#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 1541#L19-4 assume true; 1542#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1557#L21-4 assume true; 1588#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1568#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1569#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1590#L21-4 assume true; 1563#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1564#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1556#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1552#L21-4 assume true; 1553#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1589#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1555#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1550#L21-4 assume true; 1551#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1549#L21-5 [2018-11-18 15:33:25,239 INFO L796 eck$LassoCheckResult]: Loop: 1549#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1547#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 1548#L19-4 assume true; 1572#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1573#L21-4 assume true; 1585#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1549#L21-5 [2018-11-18 15:33:25,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash 197184582, now seen corresponding path program 3 times [2018-11-18 15:33:25,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:25,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:33:25,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:33:25,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:33:25,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 15:33:25,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:33:25,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:33:25,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:33:25,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-11-18 15:33:25,428 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:33:25,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2045542101, now seen corresponding path program 9 times [2018-11-18 15:33:25,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:33:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:33:25,472 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 8 Second operand 13 states. [2018-11-18 15:33:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:33:25,555 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-18 15:33:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:33:25,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 70 transitions. [2018-11-18 15:33:25,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:25,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 62 states and 67 transitions. [2018-11-18 15:33:25,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 15:33:25,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 15:33:25,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2018-11-18 15:33:25,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:25,557 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-18 15:33:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2018-11-18 15:33:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-18 15:33:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 15:33:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-18 15:33:25,559 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-18 15:33:25,559 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-18 15:33:25,559 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 15:33:25,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 58 transitions. [2018-11-18 15:33:25,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:33:25,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:25,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:25,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:25,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:33:25,561 INFO L794 eck$LassoCheckResult]: Stem: 1815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 1814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 1806#L33-4 assume true; 1807#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1810#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1808#L33-4 assume true; 1809#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1833#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1832#L33-4 assume true; 1831#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1830#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1829#L33-4 assume true; 1828#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1827#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1826#L33-4 assume true; 1824#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 1825#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 1823#L33-4 assume true; 1816#L33-1 assume !(main_~i~1 >= 0); 1802#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 1789#L19-4 assume true; 1790#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1798#L21-4 assume true; 1799#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1817#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1818#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1839#L21-4 assume true; 1812#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1813#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1840#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1842#L21-4 assume true; 1841#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1819#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1805#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1800#L21-4 assume true; 1801#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1838#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 1837#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 1836#L21-4 assume true; 1811#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1795#L21-5 [2018-11-18 15:33:25,561 INFO L796 eck$LassoCheckResult]: Loop: 1795#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 1796#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 1797#L19-4 assume true; 1822#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 1804#L21-4 assume true; 1834#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 1795#L21-5 [2018-11-18 15:33:25,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1787050125, now seen corresponding path program 4 times [2018-11-18 15:33:25,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2045542101, now seen corresponding path program 10 times [2018-11-18 15:33:25,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1215701175, now seen corresponding path program 1 times [2018-11-18 15:33:25,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:33:25,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:33:25,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c21d3b6a-17e1-4baf-815a-79219bfa376e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:33:25,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:33:25,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:33:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 15:33:25,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:33:25,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2018-11-18 15:33:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:33:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:33:25,749 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-11-18 15:33:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:33:25,909 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-18 15:33:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 15:33:25,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 123 transitions. [2018-11-18 15:33:25,911 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2018-11-18 15:33:25,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 123 transitions. [2018-11-18 15:33:25,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-18 15:33:25,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-18 15:33:25,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 123 transitions. [2018-11-18 15:33:25,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:33:25,913 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-11-18 15:33:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 123 transitions. [2018-11-18 15:33:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2018-11-18 15:33:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 15:33:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-11-18 15:33:25,916 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-11-18 15:33:25,916 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-11-18 15:33:25,916 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 15:33:25,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 87 transitions. [2018-11-18 15:33:25,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-18 15:33:25,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:33:25,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:33:25,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:33:25,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:33:25,917 INFO L794 eck$LassoCheckResult]: Stem: 2167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~n~0 := 5; 2166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post6, main_#t~mem8, main_#t~post7, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.alloc(20);havoc main_~i~1;main_~i~1 := 4; 2157#L33-4 assume true; 2158#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 2161#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 2159#L33-4 assume true; 2160#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 2182#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 2181#L33-4 assume true; 2180#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 2179#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 2178#L33-4 assume true; 2177#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 2176#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 2175#L33-4 assume true; 2173#L33-1 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 2174#L33-3 main_#t~post6 := main_~i~1;main_~i~1 := main_#t~post6 - 1;havoc main_#t~post6; 2172#L33-4 assume true; 2168#L33-1 assume !(main_~i~1 >= 0); 2150#L33-5 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~post1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~post0, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 2151#L19-4 assume true; 2189#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 2188#L21-4 assume true; 2187#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2185#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2186#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2148#L21-4 assume true; 2149#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2169#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2153#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2154#L21-4 assume true; 2164#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2165#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2202#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2204#L21-4 assume true; 2203#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2200#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2201#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2208#L21-4 assume true; 2193#L21-1 assume !(SelectionSort_~i~0 < ~n~0); 2194#L21-5 call SelectionSort_#t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem4;havoc SelectionSort_#t~mem4;call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem5;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2216#L19-3 SelectionSort_#t~post0 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post0;havoc SelectionSort_#t~post0; 2137#L19-4 assume true; 2138#L19-1 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 2213#L21-4 assume true; 2211#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2210#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2209#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2207#L21-4 assume true; 2205#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2199#L22 [2018-11-18 15:33:25,918 INFO L796 eck$LassoCheckResult]: Loop: 2199#L22 assume !(SelectionSort_#t~mem2 < SelectionSort_#t~mem3);havoc SelectionSort_#t~mem2;havoc SelectionSort_#t~mem3; 2197#L21-3 SelectionSort_#t~post1 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post1;havoc SelectionSort_#t~post1; 2195#L21-4 assume true; 2196#L21-1 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 2199#L22 [2018-11-18 15:33:25,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash -358093696, now seen corresponding path program 2 times [2018-11-18 15:33:25,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:33:25,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2156488, now seen corresponding path program 2 times [2018-11-18 15:33:25,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:33:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1139834055, now seen corresponding path program 3 times [2018-11-18 15:33:25,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:33:25,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:33:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:33:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:33:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:33:29,175 WARN L180 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 262 DAG size of output: 194 [2018-11-18 15:33:29,336 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 15:33:29,337 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:33:29,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:33:29,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:33:29,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:33:29,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:33:29,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:33:29,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:33:29,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:33:29,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-18 15:33:29,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:33:29,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:33:29,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-18 15:33:29,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-18 15:33:29,344 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-18 15:33:29,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-18 15:33:29,383 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 15:33:29,385 INFO L168 Benchmark]: Toolchain (without parser) took 429348.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 961.9 MB in the beginning and 797.4 MB in the end (delta: 164.5 MB). Peak memory consumption was 375.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,386 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:33:29,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.34 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,386 INFO L168 Benchmark]: Boogie Preprocessor took 54.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,387 INFO L168 Benchmark]: RCFGBuilder took 192.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,387 INFO L168 Benchmark]: BuchiAutomizer took 428906.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 797.4 MB in the end (delta: 311.3 MB). Peak memory consumption was 386.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:33:29,390 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.34 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 428906.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 797.4 MB in the end (delta: 311.3 MB). Peak memory consumption was 386.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...