./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash af6d3df1a288680024c52d2d61adb02fdd276fce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:49:53,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:49:53,550 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:49:53,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:49:53,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:49:53,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:49:53,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:49:53,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:49:53,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:49:53,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:49:53,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:49:53,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:49:53,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:49:53,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:49:53,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:49:53,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:49:53,565 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:49:53,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:49:53,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:49:53,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:49:53,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:49:53,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:49:53,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:49:53,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:49:53,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:49:53,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:49:53,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:49:53,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:49:53,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:49:53,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:49:53,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:49:53,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:49:53,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:49:53,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:49:53,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:49:53,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:49:53,576 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:49:53,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:49:53,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:49:53,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:49:53,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:49:53,585 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:49:53,586 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:49:53,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:49:53,586 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:49:53,587 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:49:53,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:49:53,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:49:53,588 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:49:53,589 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:49:53,589 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_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af6d3df1a288680024c52d2d61adb02fdd276fce [2018-11-23 15:49:53,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:49:53,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:49:53,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:49:53,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:49:53,628 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:49:53,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-23 15:49:53,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/data/99050d031/4ac4c80e7b45441fbf34df45f8df25b5/FLAGf468bce92 [2018-11-23 15:49:54,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:49:54,106 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-23 15:49:54,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/data/99050d031/4ac4c80e7b45441fbf34df45f8df25b5/FLAGf468bce92 [2018-11-23 15:49:54,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/bin-2019/uautomizer/data/99050d031/4ac4c80e7b45441fbf34df45f8df25b5 [2018-11-23 15:49:54,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:49:54,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:49:54,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:49:54,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:49:54,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:49:54,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec40b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54, skipping insertion in model container [2018-11-23 15:49:54,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:49:54,175 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:49:54,370 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:49:54,378 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:49:54,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:49:54,472 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:49:54,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54 WrapperNode [2018-11-23 15:49:54,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:49:54,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:49:54,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:49:54,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:49:54,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:49:54,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:49:54,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:49:54,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:49:54,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... [2018-11-23 15:49:54,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:49:54,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:49:54,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:49:54,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:49:54,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/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-23 15:49:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:49:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:49:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:49:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:49:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:49:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:49:54,682 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:49:54,682 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:49:54,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:54 BoogieIcfgContainer [2018-11-23 15:49:54,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:49:54,683 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:49:54,683 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:49:54,685 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:49:54,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:49:54,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:49:54" (1/3) ... [2018-11-23 15:49:54,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cbedf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:49:54, skipping insertion in model container [2018-11-23 15:49:54,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:49:54,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:54" (2/3) ... [2018-11-23 15:49:54,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cbedf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:49:54, skipping insertion in model container [2018-11-23 15:49:54,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:49:54,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:54" (3/3) ... [2018-11-23 15:49:54,688 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-termination.c.i [2018-11-23 15:49:54,721 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:49:54,722 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:49:54,722 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:49:54,722 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:49:54,722 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:49:54,722 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:49:54,722 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:49:54,722 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:49:54,722 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:49:54,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 15:49:54,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 15:49:54,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:54,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:54,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:49:54,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:54,751 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:49:54,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 15:49:54,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 15:49:54,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:54,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:54,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:49:54,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:54,759 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2018-11-23 15:49:54,759 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2018-11-23 15:49:54,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 15:49:54,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-11-23 15:49:54,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:54,863 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-23 15:49:54,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:49:54,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:49:54,867 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:49:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:49:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:49:54,877 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-23 15:49:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:54,882 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-23 15:49:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:49:54,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-23 15:49:54,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 15:49:54,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-23 15:49:54,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:49:54,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 15:49:54,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-23 15:49:54,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:49:54,889 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 15:49:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-23 15:49:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 15:49:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 15:49:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-23 15:49:54,906 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 15:49:54,906 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 15:49:54,906 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:49:54,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-23 15:49:54,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 15:49:54,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:54,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:54,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:49:54,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:54,908 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2018-11-23 15:49:54,908 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2018-11-23 15:49:54,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 15:49:54,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-11-23 15:49:54,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:54,946 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-23 15:49:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:49:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:49:54,947 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:49:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:49:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:49:54,947 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 15:49:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:54,964 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-11-23 15:49:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:49:54,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2018-11-23 15:49:54,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:49:54,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 15:49:54,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:49:54,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:49:54,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 15:49:54,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:49:54,967 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:49:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 15:49:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 15:49:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:49:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 15:49:54,968 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:49:54,968 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:49:54,968 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:49:54,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 15:49:54,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:49:54,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:54,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:54,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:49:54,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:49:54,970 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2018-11-23 15:49:54,970 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2018-11-23 15:49:54,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-23 15:49:54,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2018-11-23 15:49:54,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:55,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2018-11-23 15:49:55,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:55,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,140 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-11-23 15:49:55,287 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:49:55,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:49:55,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:49:55,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:49:55,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:49:55,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:49:55,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:49:55,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:49:55,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:49:55,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:49:55,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:49:55,310 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-23 15:49:55,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:55,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:55,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:55,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:55,451 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-23 15:49:55,453 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-23 15:49:55,455 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-23 15:49:55,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:55,459 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-23 15:49:55,460 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-23 15:49:55,461 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-23 15:49:55,463 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-23 15:49:55,464 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-23 15:49:55,707 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:49:55,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:49:55,712 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-23 15:49:55,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:55,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:49:55,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:55,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:55,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:55,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:49:55,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:49:55,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:55,721 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-23 15:49:55,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:55,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:55,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:55,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:55,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:55,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:55,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:49:55,813 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:49:55,814 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 15:49:55,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:49:55,817 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:49:55,818 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:49:55,818 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-23 15:49:55,852 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:49:55,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:55,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:55,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 15:49:55,922 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-23 15:49:55,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 15:49:55,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2018-11-23 15:49:55,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:49:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:49:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 15:49:55,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 15:49:55,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 15:49:55,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 15:49:55,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:55,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-23 15:49:55,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:55,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2018-11-23 15:49:55,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:49:55,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 15:49:55,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2018-11-23 15:49:55,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:49:55,952 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 15:49:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2018-11-23 15:49:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 15:49:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:49:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-23 15:49:55,953 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 15:49:55,953 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 15:49:55,954 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:49:55,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-23 15:49:55,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:55,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:55,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:55,954 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:49:55,954 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:55,955 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L558 assume !(main_~array_size~0 < 1); 159#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 161#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 153#L551-3 [2018-11-23 15:49:55,955 INFO L796 eck$LassoCheckResult]: Loop: 153#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 154#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 162#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 153#L551-3 [2018-11-23 15:49:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 15:49:55,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:55,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-23 15:49:55,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:55,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-23 15:49:55,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:49:56,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:49:56,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:49:56,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:49:56,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:49:56,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:49:56,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:49:56,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:49:56,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 15:49:56,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:49:56,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:49:56,141 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-23 15:49:56,144 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-23 15:49:56,145 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-23 15:49:56,241 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-23 15:49:56,242 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-23 15:49:56,244 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-23 15:49:56,245 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-23 15:49:56,246 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-23 15:49:56,247 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-23 15:49:56,248 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-23 15:49:56,249 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-23 15:49:56,250 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-23 15:49:56,251 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-23 15:49:56,252 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-23 15:49:56,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:49:56,452 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:49:56,452 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-23 15:49:56,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:56,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:49:56,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:56,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:56,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:56,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:49:56,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:49:56,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:56,455 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-23 15:49:56,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:56,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:49:56,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:56,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:56,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:56,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:49:56,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:49:56,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:56,457 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-23 15:49:56,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:56,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:56,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:56,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:56,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:56,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:56,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:56,466 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-23 15:49:56,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:56,466 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:49:56,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:56,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:56,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:49:56,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:56,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:56,475 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-23 15:49:56,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:56,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:56,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:56,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:56,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:56,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:56,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:49:56,511 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 15:49:56,511 INFO L444 ModelExtractionUtils]: 26 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 15:49:56,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:49:56,512 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:49:56,512 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:49:56,512 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-23 15:49:56,529 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:49:56,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:56,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:56,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:56,573 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-23 15:49:56,574 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-23 15:49:56,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 15:49:56,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2018-11-23 15:49:56,594 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-23 15:49:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:49:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:49:56,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 15:49:56,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:56,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 15:49:56,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:56,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 15:49:56,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:56,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-11-23 15:49:56,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:56,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2018-11-23 15:49:56,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:49:56,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:49:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-23 15:49:56,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:49:56,599 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-23 15:49:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-23 15:49:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-11-23 15:49:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:49:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 15:49:56,603 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 15:49:56,603 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 15:49:56,603 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:49:56,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-23 15:49:56,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:56,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:56,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:56,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:56,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:56,605 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 266#L558 assume !(main_~array_size~0 < 1); 267#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 268#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 261#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 262#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 271#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 272#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 263#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 264#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 259#L551-3 [2018-11-23 15:49:56,605 INFO L796 eck$LassoCheckResult]: Loop: 259#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 260#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 270#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 259#L551-3 [2018-11-23 15:49:56,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-11-23 15:49:56,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:56,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:49:56,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:56,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/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-23 15:49:56,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:56,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:49:56,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:56,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 15:49:56,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:49:56,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-23 15:49:56,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:49:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:49:56,784 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-23 15:49:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:56,824 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-11-23 15:49:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:49:56,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-23 15:49:56,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:56,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2018-11-23 15:49:56,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 15:49:56,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 15:49:56,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-23 15:49:56,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:49:56,826 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 15:49:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-23 15:49:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-23 15:49:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 15:49:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 15:49:56,828 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 15:49:56,828 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 15:49:56,828 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:49:56,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-23 15:49:56,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:49:56,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:56,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:56,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:56,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:56,829 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 351#L558 assume !(main_~array_size~0 < 1); 352#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 353#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 346#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 347#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 356#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 357#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 360#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 348#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 349#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 344#L551-3 [2018-11-23 15:49:56,829 INFO L796 eck$LassoCheckResult]: Loop: 344#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 345#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 355#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 344#L551-3 [2018-11-23 15:49:56,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-11-23 15:49:56,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-23 15:49:56,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:56,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:56,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2018-11-23 15:49:56,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:49:57,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:49:57,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35cf2df4-9857-467a-92bd-322c21f2b9f3/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-23 15:49:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:57,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:57,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 30 treesize of output 22 [2018-11-23 15:49:57,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:49:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 16 [2018-11-23 15:49:57,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:49:57,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:49:57,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:49:57,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 15:49:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:49:57,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:49:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 15:49:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:49:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:49:57,269 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 17 states. [2018-11-23 15:49:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:49:57,526 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-23 15:49:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 15:49:57,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-23 15:49:57,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 15:49:57,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2018-11-23 15:49:57,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 15:49:57,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 15:49:57,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2018-11-23 15:49:57,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:49:57,529 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-11-23 15:49:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2018-11-23 15:49:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-11-23 15:49:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 15:49:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-23 15:49:57,533 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-23 15:49:57,533 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-23 15:49:57,533 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:49:57,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-23 15:49:57,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:49:57,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:49:57,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:49:57,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:49:57,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:49:57,535 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 511#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 512#L558 assume !(main_~array_size~0 < 1); 519#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 521#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 522#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 538#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 527#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 528#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 532#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 533#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 546#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 544#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 541#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 513#L551-3 [2018-11-23 15:49:57,535 INFO L796 eck$LassoCheckResult]: Loop: 513#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 514#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 525#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 513#L551-3 [2018-11-23 15:49:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2018-11-23 15:49:57,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:49:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-11-23 15:49:57,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2018-11-23 15:49:57,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:49:57,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:49:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:49:57,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:49:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:49:57,791 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-23 15:49:57,834 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:49:57,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:49:57,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:49:57,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:49:57,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:49:57,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:49:57,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:49:57,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:49:57,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 15:49:57,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:49:57,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:49:57,837 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-23 15:49:57,966 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-23 15:49:57,968 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-23 15:49:57,970 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-23 15:49:57,971 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-23 15:49:57,972 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-23 15:49:57,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:57,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:57,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:57,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:57,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:57,978 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-23 15:49:57,979 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-23 15:49:57,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:49:58,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:49:58,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:49:58,156 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-23 15:49:58,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:58,157 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:49:58,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:58,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:58,158 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:49:58,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:58,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:58,166 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-23 15:49:58,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:58,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:58,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:58,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:58,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:58,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:58,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:58,171 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-23 15:49:58,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:58,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:58,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:58,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:58,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:58,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:58,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:49:58,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:49:58,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:49:58,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:49:58,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:49:58,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:49:58,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:49:58,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:49:58,193 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:49:58,207 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:49:58,207 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:49:58,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:49:58,208 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:49:58,208 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:49:58,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-23 15:49:58,224 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 15:49:58,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:49:58,250 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-23 15:49:58,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 15:49:58,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2018-11-23 15:49:58,263 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-23 15:49:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:49:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:49:58,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:49:58,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:58,264 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:49:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,302 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-23 15:49:58,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:49:58,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 15:49:58,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2018-11-23 15:49:58,321 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-23 15:49:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:49:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:49:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:49:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:58,322 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:49:58,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:49:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:49:58,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:49:58,348 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-23 15:49:58,349 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:49:58,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 15:49:58,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 67 states and 92 transitions. Complement of second has 6 states. [2018-11-23 15:49:58,364 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-23 15:49:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:49:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 15:49:58,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:49:58,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:58,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 15:49:58,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:58,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 15:49:58,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:49:58,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2018-11-23 15:49:58,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:49:58,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2018-11-23 15:49:58,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:49:58,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:49:58,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:49:58,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:49:58,370 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:49:58,370 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:49:58,370 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:49:58,370 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 15:49:58,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:49:58,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:49:58,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:49:58,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:49:58 BoogieIcfgContainer [2018-11-23 15:49:58,375 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:49:58,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:49:58,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:49:58,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:49:58,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:54" (3/4) ... [2018-11-23 15:49:58,379 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:49:58,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:49:58,379 INFO L168 Benchmark]: Toolchain (without parser) took 4248.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 956.6 MB in the beginning and 924.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 224.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:58,380 INFO L168 Benchmark]: CDTParser took 0.15 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-23 15:49:58,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:58,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:58,381 INFO L168 Benchmark]: Boogie Preprocessor took 14.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:49:58,381 INFO L168 Benchmark]: RCFGBuilder took 167.14 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:58,382 INFO L168 Benchmark]: BuchiAutomizer took 3692.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 185.9 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:49:58,382 INFO L168 Benchmark]: Witness Printer took 3.50 ms. Allocated memory is still 1.2 GB. Free memory is still 924.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:49:58,385 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.15 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 340.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 167.14 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3692.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 185.9 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.50 ms. Allocated memory is still 1.2 GB. Free memory is still 924.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 82 SDtfs, 93 SDslu, 70 SDs, 0 SdLazy, 210 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital183 mio100 ax110 hnf99 lsp87 ukn65 mio100 lsp60 div100 bol100 ite100 ukn100 eq180 hnf88 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...