./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65401fe061f89bb729dffabf74050dfab9fe7d77 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:50:34,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:50:34,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:50:34,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:50:34,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:50:34,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:50:34,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:50:34,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:50:34,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:50:34,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:50:34,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:50:34,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:50:34,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:50:34,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:50:34,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:50:34,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:50:34,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:50:34,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:50:34,582 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:50:34,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:50:34,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:50:34,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:50:34,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:50:34,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:50:34,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:50:34,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:50:34,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:50:34,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:50:34,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:50:34,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:50:34,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:50:34,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:50:34,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:50:34,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:50:34,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:50:34,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:50:34,593 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 12:50:34,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:50:34,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:50:34,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:50:34,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:50:34,606 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:50:34,607 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:50:34,607 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:50:34,607 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:50:34,607 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:50:34,607 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:50:34,607 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:50:34,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:50:34,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:50:34,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:50:34,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:50:34,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:50:34,610 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:50:34,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:50:34,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:50:34,610 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:50:34,611 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:50:34,611 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_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2018-11-23 12:50:34,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:50:34,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:50:34,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:50:34,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:50:34,648 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:50:34,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:50:34,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/data/9ae3cb803/da3ba1a5521c459f801b4bfc2e7e0145/FLAG6f300ffbc [2018-11-23 12:50:35,031 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:50:35,032 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:50:35,038 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/data/9ae3cb803/da3ba1a5521c459f801b4bfc2e7e0145/FLAG6f300ffbc [2018-11-23 12:50:35,047 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/bin-2019/uautomizer/data/9ae3cb803/da3ba1a5521c459f801b4bfc2e7e0145 [2018-11-23 12:50:35,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:50:35,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:50:35,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:50:35,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:50:35,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:50:35,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c6fb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35, skipping insertion in model container [2018-11-23 12:50:35,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:50:35,097 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:50:35,301 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:50:35,310 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:50:35,335 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:50:35,402 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:50:35,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35 WrapperNode [2018-11-23 12:50:35,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:50:35,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:50:35,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:50:35,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:50:35,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:50:35,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:50:35,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:50:35,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:50:35,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... [2018-11-23 12:50:35,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:50:35,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:50:35,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:50:35,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:50:35,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/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 12:50:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:50:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:50:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:50:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:50:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:50:35,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:50:35,632 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:50:35,632 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:50:35,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:50:35 BoogieIcfgContainer [2018-11-23 12:50:35,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:50:35,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:50:35,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:50:35,636 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:50:35,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:50:35,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:50:35" (1/3) ... [2018-11-23 12:50:35,637 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49edf2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:50:35, skipping insertion in model container [2018-11-23 12:50:35,637 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:50:35,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:35" (2/3) ... [2018-11-23 12:50:35,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49edf2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:50:35, skipping insertion in model container [2018-11-23 12:50:35,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:50:35,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:50:35" (3/3) ... [2018-11-23 12:50:35,639 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:50:35,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:50:35,683 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:50:35,683 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:50:35,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:50:35,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:50:35,683 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:50:35,684 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:50:35,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:50:35,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:50:35,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 12:50:35,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:50:35,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:35,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:35,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 12:50:35,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:35,713 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:50:35,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 12:50:35,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:50:35,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:35,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:35,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 12:50:35,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:35,723 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 10#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L551-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; 11#L543-3true [2018-11-23 12:50:35,723 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 8#L544-3true assume !true; 9#L543-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 11#L543-3true [2018-11-23 12:50:35,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 12:50:35,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-11-23 12:50:35,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:35,827 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 12:50:35,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:50:35,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:50:35,831 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:50:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:50:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:50:35,842 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-23 12:50:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:50:35,847 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-23 12:50:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:50:35,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-23 12:50:35,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:50:35,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-23 12:50:35,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 12:50:35,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 12:50:35,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-23 12:50:35,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:50:35,854 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 12:50:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-23 12:50:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 12:50:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:50:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-23 12:50:35,871 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 12:50:35,871 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 12:50:35,871 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:50:35,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-23 12:50:35,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:50:35,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:35,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:35,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 12:50:35,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:35,873 INFO L794 eck$LassoCheckResult]: Stem: 38#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#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42#L551-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; 41#L543-3 [2018-11-23 12:50:35,873 INFO L796 eck$LassoCheckResult]: Loop: 41#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 37#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 39#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 41#L543-3 [2018-11-23 12:50:35,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 12:50:35,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-11-23 12:50:35,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:35,911 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 12:50:35,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:50:35,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:50:35,911 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:50:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:50:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:50:35,912 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 12:50:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:50:35,936 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-11-23 12:50:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:50:35,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2018-11-23 12:50:35,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 12:50:35,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 12:50:35,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 12:50:35,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 12:50:35,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 12:50:35,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:50:35,938 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:50:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 12:50:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 12:50:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:50:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 12:50:35,940 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:50:35,940 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:50:35,940 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:50:35,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 12:50:35,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 12:50:35,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:35,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:35,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 12:50:35,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:50:35,941 INFO L794 eck$LassoCheckResult]: Stem: 63#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#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 68#L551-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; 67#L543-3 [2018-11-23 12:50:35,941 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 64#L544-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); 65#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 61#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 62#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 66#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 67#L543-3 [2018-11-23 12:50:35,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-23 12:50:35,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2018-11-23 12:50:35,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2018-11-23 12:50:35,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:35,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,209 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:50:36,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:50:36,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:50:36,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:50:36,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:50:36,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:50:36,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:50:36,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:50:36,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 12:50:36,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:50:36,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:50:36,234 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 12:50:36,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,341 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 12:50:36,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,352 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 12:50:36,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:36,357 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 12:50:36,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:50:36,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:50:36,587 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 12:50:36,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:36,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:50:36,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:36,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:36,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:36,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:50:36,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:50:36,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:36,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:50:36,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:36,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:36,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:36,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:36,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:36,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:36,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:50:36,692 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 12:50:36,692 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 12:50:36,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:50:36,695 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:50:36,696 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:50:36,696 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 12:50:36,728 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 12:50:36,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:36,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:36,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:36,799 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 12:50:36,801 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 12:50:36,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 12:50:36,823 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 12:50:36,823 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 12:50:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:50:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 12:50:36,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 12:50:36,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:36,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 12:50:36,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:36,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 12:50:36,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:36,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-23 12:50:36,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:36,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2018-11-23 12:50:36,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 12:50:36,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 12:50:36,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2018-11-23 12:50:36,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:50:36,828 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 12:50:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2018-11-23 12:50:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 12:50:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:50:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-23 12:50:36,830 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 12:50:36,830 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 12:50:36,830 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:50:36,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-23 12:50:36,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:36,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:36,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:36,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:50:36,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:36,831 INFO L794 eck$LassoCheckResult]: Stem: 157#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#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 163#L551-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; 164#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 154#L544-3 [2018-11-23 12:50:36,832 INFO L796 eck$LassoCheckResult]: Loop: 154#L544-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); 158#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 153#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 154#L544-3 [2018-11-23 12:50:36,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 12:50:36,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-23 12:50:36,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-23 12:50:36,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:36,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,061 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:50:37,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:50:37,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:50:37,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:50:37,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:50:37,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:50:37,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:50:37,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:50:37,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-23 12:50:37,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:50:37,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:50:37,065 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 12:50:37,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,078 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 12:50:37,165 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 12:50:37,166 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 12:50:37,168 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 12:50:37,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:37,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:50:37,349 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:50:37,349 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 12:50:37,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:37,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:50:37,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:37,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:37,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:37,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:50:37,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:50:37,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:37,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:50:37,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:37,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:50:37,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:37,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:37,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:37,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:50:37,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:50:37,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:37,356 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 12:50:37,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:37,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:37,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:37,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:37,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:37,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:37,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:37,365 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 12:50:37,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:37,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:50:37,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:37,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:37,369 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:50:37,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:37,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:37,378 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 12:50:37,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:37,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:37,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:37,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:37,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:37,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:37,402 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:50:37,418 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 12:50:37,418 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 12:50:37,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:50:37,419 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:50:37,419 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:50:37,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_2, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 - 1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [] [2018-11-23 12:50:37,436 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 12:50:37,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:50:37,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:37,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:37,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:37,485 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 12:50:37,486 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 12:50:37,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 12:50:37,518 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 12:50:37,520 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 12:50:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:50:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 12:50:37,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 12:50:37,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:37,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 12:50:37,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:37,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 12:50:37,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:37,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-11-23 12:50:37,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:37,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2018-11-23 12:50:37,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 12:50:37,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 12:50:37,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-23 12:50:37,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:50:37,524 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-23 12:50:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-23 12:50:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-11-23 12:50:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:50:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 12:50:37,528 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 12:50:37,528 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 12:50:37,528 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:50:37,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-23 12:50:37,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:37,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:37,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:37,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:50:37,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:37,529 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#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; 260#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 271#L551-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; 272#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 267#L544-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); 268#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 263#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 264#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 269#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 270#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 262#L544-3 [2018-11-23 12:50:37,529 INFO L796 eck$LassoCheckResult]: Loop: 262#L544-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); 266#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 261#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 262#L544-3 [2018-11-23 12:50:37,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-11-23 12:50:37,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:37,576 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 12:50:37,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:50:37,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/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 12:50:37,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:37,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:37,616 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 12:50:37,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:50:37,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:50:37,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:50:37,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-23 12:50:37,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:50:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:50:37,738 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-23 12:50:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:50:37,771 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-11-23 12:50:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:50:37,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-23 12:50:37,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:37,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2018-11-23 12:50:37,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 12:50:37,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 12:50:37,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-23 12:50:37,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:50:37,773 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 12:50:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-23 12:50:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-23 12:50:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:50:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 12:50:37,775 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 12:50:37,775 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 12:50:37,775 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 12:50:37,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-23 12:50:37,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:50:37,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:37,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:37,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 12:50:37,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:37,776 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 344#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; 345#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 355#L551-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; 356#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 357#L544-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); 360#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 348#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 349#L544-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); 352#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 358#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 359#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 353#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 354#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 347#L544-3 [2018-11-23 12:50:37,776 INFO L796 eck$LassoCheckResult]: Loop: 347#L544-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); 351#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 346#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 347#L544-3 [2018-11-23 12:50:37,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-11-23 12:50:37,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:37,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-23 12:50:37,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:37,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:37,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2018-11-23 12:50:37,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:50:38,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:50:38,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56ce1730-9e33-48fc-9cd2-bb7ecf430d4f/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 12:50:38,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:38,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:38,164 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 12:50:38,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:50:38,168 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 12:50:38,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:50:38,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:50:38,173 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 12:50:38,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:50:38,181 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 12:50:38,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:50:38,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:50:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:50:38,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:50:38,245 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 19 states. [2018-11-23 12:50:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:50:38,623 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-23 12:50:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:50:38,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-23 12:50:38,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 12:50:38,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2018-11-23 12:50:38,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 12:50:38,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 12:50:38,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2018-11-23 12:50:38,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:50:38,625 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-11-23 12:50:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2018-11-23 12:50:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-11-23 12:50:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:50:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-23 12:50:38,627 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-23 12:50:38,627 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-23 12:50:38,627 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 12:50:38,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-23 12:50:38,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 12:50:38,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:50:38,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:50:38,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:50:38,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:50:38,630 INFO L794 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#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; 516#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 526#L551-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; 527#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 528#L544-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); 543#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 519#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 520#L544-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); 523#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 537#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 551#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 549#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 546#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 518#L544-3 [2018-11-23 12:50:38,630 INFO L796 eck$LassoCheckResult]: Loop: 518#L544-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); 522#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;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); 517#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 518#L544-3 [2018-11-23 12:50:38,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2018-11-23 12:50:38,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:38,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:38,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-11-23 12:50:38,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:38,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:38,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:38,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2018-11-23 12:50:38,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:50:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:50:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:50:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:50:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:50:38,877 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2018-11-23 12:50:38,916 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:50:38,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:50:38,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:50:38,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:50:38,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:50:38,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:50:38,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:50:38,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:50:38,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-23 12:50:38,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:50:38,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:50:38,918 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 12:50:39,059 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 12:50:39,060 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 12:50:39,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:39,063 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 12:50:39,065 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 12:50:39,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:39,067 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 12:50:39,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:39,069 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 12:50:39,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:50:39,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:50:39,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:50:39,253 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 12:50:39,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:39,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:50:39,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:39,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:39,256 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:50:39,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:39,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:39,262 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 12:50:39,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:39,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:39,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:39,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:39,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:39,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:39,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:39,266 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 12:50:39,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:39,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:39,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:39,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:39,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:39,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:39,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:50:39,273 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 12:50:39,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:50:39,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:50:39,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:50:39,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:50:39,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:50:39,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:50:39,287 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:50:39,304 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 12:50:39,304 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 12:50:39,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:50:39,305 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:50:39,305 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:50:39,305 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 12:50:39,336 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 12:50:39,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,365 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 12:50:39,365 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 12:50:39,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 12:50:39,379 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 12:50:39,381 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 12:50:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:50:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 12:50:39,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 12:50:39,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:39,381 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:50:39,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,413 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 12:50:39,413 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 12:50:39,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 12:50:39,428 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 12:50:39,430 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 12:50:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:50:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 12:50:39,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 12:50:39,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:39,431 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:50:39,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:39,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:39,459 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 12:50:39,460 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 12:50:39,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-23 12:50:39,475 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 12:50:39,476 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 12:50:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:50:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 12:50:39,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 12:50:39,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:39,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 12:50:39,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:39,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 12:50:39,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:50:39,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2018-11-23 12:50:39,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:50:39,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2018-11-23 12:50:39,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:50:39,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:50:39,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:50:39,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:50:39,480 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:50:39,480 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:50:39,480 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:50:39,480 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 12:50:39,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:50:39,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:50:39,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:50:39,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:50:39 BoogieIcfgContainer [2018-11-23 12:50:39,486 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:50:39,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:50:39,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:50:39,486 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:50:39,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:50:35" (3/4) ... [2018-11-23 12:50:39,489 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:50:39,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:50:39,490 INFO L168 Benchmark]: Toolchain (without parser) took 4439.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 956.6 MB in the beginning and 890.9 MB in the end (delta: 65.7 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:50:39,490 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:50:39,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:50:39,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.77 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 12:50:39,492 INFO L168 Benchmark]: Boogie Preprocessor took 14.81 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 12:50:39,492 INFO L168 Benchmark]: RCFGBuilder took 186.52 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:50:39,493 INFO L168 Benchmark]: BuchiAutomizer took 3852.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 890.9 MB in the end (delta: 219.2 MB). Peak memory consumption was 265.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:50:39,493 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.2 GB. Free memory is still 890.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:50:39,496 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.77 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.81 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 186.52 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3852.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 890.9 MB in the end (delta: 219.2 MB). Peak memory consumption was 265.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.2 GB. Free memory is still 890.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 unknown-#length-unknown[x] + -1 * x + -4 * i 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 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. 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: 83 SDtfs, 89 SDslu, 66 SDs, 0 SdLazy, 255 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax100 hnf99 lsp96 ukn66 mio100 lsp61 div100 bol100 ite100 ukn100 eq178 hnf88 smp92 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms 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...