./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:47:32,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:47:32,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:47:32,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:47:32,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:47:32,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:47:32,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:47:32,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:47:32,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:47:32,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:47:32,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:47:32,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:47:32,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:47:32,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:47:32,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:47:32,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:47:32,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:47:32,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:47:32,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:47:32,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:47:32,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:47:32,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:47:32,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:47:32,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:47:32,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:47:32,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:47:32,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:47:32,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:47:32,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:47:32,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:47:32,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:47:32,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:47:32,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:47:32,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:47:32,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:47:32,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:47:32,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:47:32,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:47:32,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:47:32,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:47:32,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:47:32,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 07:47:32,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:47:32,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:47:32,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:47:32,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:47:32,897 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:47:32,898 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 07:47:32,898 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 07:47:32,898 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 07:47:32,898 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 07:47:32,898 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 07:47:32,899 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 07:47:32,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:47:32,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 07:47:32,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:47:32,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:47:32,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 07:47:32,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 07:47:32,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 07:47:32,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:47:32,901 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 07:47:32,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:47:32,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 07:47:32,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:47:32,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:47:32,902 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 07:47:32,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:47:32,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:47:32,903 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 07:47:32,904 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 07:47:32,904 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2019-11-20 07:47:33,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:47:33,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:47:33,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:47:33,089 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:47:33,090 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:47:33,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2019-11-20 07:47:33,157 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/data/6ee901b86/b72e1b44f643452ab0baa24a81b56160/FLAG90a682c2e [2019-11-20 07:47:33,524 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:47:33,525 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2019-11-20 07:47:33,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/data/6ee901b86/b72e1b44f643452ab0baa24a81b56160/FLAG90a682c2e [2019-11-20 07:47:33,872 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/data/6ee901b86/b72e1b44f643452ab0baa24a81b56160 [2019-11-20 07:47:33,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:47:33,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:47:33,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:47:33,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:47:33,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:47:33,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:47:33" (1/1) ... [2019-11-20 07:47:33,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292a2321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:33, skipping insertion in model container [2019-11-20 07:47:33,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:47:33" (1/1) ... [2019-11-20 07:47:33,894 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:47:33,939 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:47:34,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:47:34,317 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:47:34,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:47:34,425 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:47:34,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34 WrapperNode [2019-11-20 07:47:34,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:47:34,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:47:34,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:47:34,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:47:34,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:47:34,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:47:34,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:47:34,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:47:34,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... [2019-11-20 07:47:34,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:47:34,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:47:34,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:47:34,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:47:34,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 07:47:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 07:47:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:47:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:47:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:47:34,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:47:34,794 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:47:34,794 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 07:47:34,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:47:34 BoogieIcfgContainer [2019-11-20 07:47:34,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:47:34,796 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 07:47:34,796 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 07:47:34,800 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 07:47:34,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:47:34,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 07:47:33" (1/3) ... [2019-11-20 07:47:34,802 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659d4476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:47:34, skipping insertion in model container [2019-11-20 07:47:34,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:47:34,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:47:34" (2/3) ... [2019-11-20 07:47:34,803 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659d4476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 07:47:34, skipping insertion in model container [2019-11-20 07:47:34,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 07:47:34,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:47:34" (3/3) ... [2019-11-20 07:47:34,805 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2019-11-20 07:47:34,842 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 07:47:34,842 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 07:47:34,842 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 07:47:34,842 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:47:34,842 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:47:34,843 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 07:47:34,843 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:47:34,843 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 07:47:34,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 07:47:34,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 07:47:34,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:34,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:34,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 07:47:34,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:34,876 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 07:47:34,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 07:47:34,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 07:47:34,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:34,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:34,877 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 07:47:34,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:34,885 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L562true assume !(main_~array_size~0 < 1); 13#L562-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 5#L550-3true [2019-11-20 07:47:34,885 INFO L796 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 3#L551-3true assume !true; 4#L550-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 5#L550-3true [2019-11-20 07:47:34,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-20 07:47:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569279073] [2019-11-20 07:47:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-20 07:47:35,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588512799] [2019-11-20 07:47:35,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:35,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588512799] [2019-11-20 07:47:35,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:47:35,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:47:35,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854608002] [2019-11-20 07:47:35,057 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 07:47:35,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:47:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 07:47:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:47:35,070 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-20 07:47:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:47:35,074 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-20 07:47:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 07:47:35,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-20 07:47:35,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 07:47:35,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-20 07:47:35,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 07:47:35,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 07:47:35,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-20 07:47:35,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:47:35,081 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 07:47:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-20 07:47:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-20 07:47:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 07:47:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-20 07:47:35,101 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 07:47:35,102 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-20 07:47:35,102 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 07:47:35,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-20 07:47:35,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-20 07:47:35,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:35,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:35,103 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 07:47:35,103 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:35,103 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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#L562 assume !(main_~array_size~0 < 1); 42#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 39#L550-3 [2019-11-20 07:47:35,104 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 36#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 37#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 39#L550-3 [2019-11-20 07:47:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-20 07:47:35,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927595357] [2019-11-20 07:47:35,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-20 07:47:35,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897780221] [2019-11-20 07:47:35,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2019-11-20 07:47:35,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470652734] [2019-11-20 07:47:35,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,224 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 07:47:35,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 07:47:35,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 07:47:35,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 07:47:35,225 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 07:47:35,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 07:47:35,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 07:47:35,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2019-11-20 07:47:35,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 07:47:35,226 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 07:47:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,392 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 07:47:35,392 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 07:47:35,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 07:47:35,421 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 07:47:35,421 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:35,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 07:47:35,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,442 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 07:47:35,442 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 07:47:35,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 07:47:35,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 07:47:35,457 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 07:47:35,473 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:35,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 07:47:35,489 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,500 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 07:47:35,502 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 07:47:35,502 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 07:47:35,502 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 07:47:35,502 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 07:47:35,503 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 07:47:35,503 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,503 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 07:47:35,503 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 07:47:35,503 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2019-11-20 07:47:35,503 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 07:47:35,503 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 07:47:35,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:35,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 07:47:35,634 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:35,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:35,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:35,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:35,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:35,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:35,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:35,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:47:35,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:35,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:35,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:35,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:35,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:35,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:35,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:35,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:47:35,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 07:47:35,688 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 07:47:35,688 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:35,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 07:47:35,700 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 07:47:35,700 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 07:47:35,700 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2019-11-20 07:47:35,704 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 07:47:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:35,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:47:35,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:35,757 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:47:35,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:35,777 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 07:47:35,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-20 07:47:35,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2019-11-20 07:47:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-20 07:47:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 07:47:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-20 07:47:35,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-20 07:47:35,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:35,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-20 07:47:35,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:35,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-20 07:47:35,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:35,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-11-20 07:47:35,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:35,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2019-11-20 07:47:35,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 07:47:35,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 07:47:35,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-11-20 07:47:35,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 07:47:35,820 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-20 07:47:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-11-20 07:47:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-20 07:47:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 07:47:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-11-20 07:47:35,822 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-20 07:47:35,822 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-20 07:47:35,822 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 07:47:35,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-11-20 07:47:35,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:35,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:35,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:35,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 07:47:35,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:35,824 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#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; 105#L562 assume !(main_~array_size~0 < 1); 111#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 108#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 99#L551-3 [2019-11-20 07:47:35,824 INFO L796 eck$LassoCheckResult]: Loop: 99#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 100#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 109#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 99#L551-3 [2019-11-20 07:47:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-20 07:47:35,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140238733] [2019-11-20 07:47:35,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-20 07:47:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976266535] [2019-11-20 07:47:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-20 07:47:35,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:35,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274969472] [2019-11-20 07:47:35,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:35,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:36,211 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-20 07:47:36,288 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 07:47:36,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 07:47:36,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 07:47:36,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 07:47:36,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 07:47:36,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:36,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 07:47:36,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 07:47:36,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2019-11-20 07:47:36,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 07:47:36,290 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 07:47:36,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,474 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-20 07:47:36,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:36,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 07:47:36,944 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 07:47:36,944 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:36,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:36,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:36,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:36,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:36,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:36,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:36,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:36,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:36,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:36,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:36,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:36,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:36,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:36,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:36,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:36,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:36,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:36,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:37,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:37,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:37,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:37,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:37,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:37,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:37,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:47:37,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:37,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:37,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:37,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:37,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:37,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:37,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:37,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:37,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:37,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:37,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:37,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 07:47:37,166 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 07:47:37,166 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:37,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 07:47:37,175 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 07:47:37,175 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 07:47:37,176 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1, ULTIMATE.start_bubbleSort_~j~0) = -1*ULTIMATE.start_bubbleSort_~numbers.offset + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1 - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2019-11-20 07:47:37,197 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 07:47:37,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 07:47:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:37,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:47:37,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:37,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:47:37,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:37,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 07:47:37,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-20 07:47:37,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 7 states. [2019-11-20 07:47:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 07:47:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 07:47:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-20 07:47:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 07:47:37,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 07:47:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 07:47:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:37,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2019-11-20 07:47:37,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:37,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2019-11-20 07:47:37,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 07:47:37,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-20 07:47:37,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-20 07:47:37,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 07:47:37,287 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-20 07:47:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-20 07:47:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-11-20 07:47:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 07:47:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-20 07:47:37,289 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-20 07:47:37,289 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-20 07:47:37,289 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 07:47:37,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-20 07:47:37,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:37,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:37,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:37,290 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-20 07:47:37,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:37,291 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#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; 210#L562 assume !(main_~array_size~0 < 1); 216#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 213#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 206#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 207#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 211#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 204#L551-3 [2019-11-20 07:47:37,291 INFO L796 eck$LassoCheckResult]: Loop: 204#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 205#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 214#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 204#L551-3 [2019-11-20 07:47:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2019-11-20 07:47:37,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:37,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561996393] [2019-11-20 07:47:37,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:37,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561996393] [2019-11-20 07:47:37,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:47:37,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:47:37,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876855214] [2019-11-20 07:47:37,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 07:47:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-20 07:47:37,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:37,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366513689] [2019-11-20 07:47:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:37,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:47:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:47:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:47:37,483 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-20 07:47:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:47:37,525 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-11-20 07:47:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:47:37,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-20 07:47:37,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:37,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-11-20 07:47:37,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 07:47:37,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 07:47:37,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-20 07:47:37,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 07:47:37,528 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-20 07:47:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-20 07:47:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-11-20 07:47:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 07:47:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 07:47:37,530 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 07:47:37,530 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 07:47:37,530 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 07:47:37,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-20 07:47:37,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:37,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:37,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:37,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:47:37,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:37,531 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 250#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; 251#L562 assume !(main_~array_size~0 < 1); 262#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 259#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 254#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 255#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 261#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 263#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 256#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 257#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 252#L551-3 [2019-11-20 07:47:37,531 INFO L796 eck$LassoCheckResult]: Loop: 252#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 253#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 260#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 252#L551-3 [2019-11-20 07:47:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-20 07:47:37,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:37,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160335614] [2019-11-20 07:47:37,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-20 07:47:37,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:37,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447568453] [2019-11-20 07:47:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:37,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2019-11-20 07:47:37,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:37,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422356015] [2019-11-20 07:47:37,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:37,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422356015] [2019-11-20 07:47:37,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875271084] [2019-11-20 07:47:37,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:47:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:37,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:47:37,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:37,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:47:37,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 07:47:37,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922771802] [2019-11-20 07:47:37,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:47:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:47:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:47:37,947 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-11-20 07:47:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:47:38,048 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-20 07:47:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:47:38,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-20 07:47:38,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:38,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-11-20 07:47:38,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 07:47:38,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 07:47:38,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-20 07:47:38,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 07:47:38,054 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-20 07:47:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-20 07:47:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-20 07:47:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 07:47:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-20 07:47:38,056 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-20 07:47:38,056 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-20 07:47:38,056 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 07:47:38,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-20 07:47:38,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:38,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:38,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:38,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 07:47:38,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:38,058 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 355#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; 356#L562 assume !(main_~array_size~0 < 1); 369#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 364#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 365#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 367#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 368#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 359#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 360#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 371#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 361#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 362#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 357#L551-3 [2019-11-20 07:47:38,058 INFO L796 eck$LassoCheckResult]: Loop: 357#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 358#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 366#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 357#L551-3 [2019-11-20 07:47:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-20 07:47:38,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717093231] [2019-11-20 07:47:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-20 07:47:38,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165633256] [2019-11-20 07:47:38,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2019-11-20 07:47:38,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479649390] [2019-11-20 07:47:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:38,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479649390] [2019-11-20 07:47:38,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194017506] [2019-11-20 07:47:38,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:47:38,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:47:38,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:47:38,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 07:47:38,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:38,594 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:47:38,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-20 07:47:38,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:47:38,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:47:38,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:47:38,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-20 07:47:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:47:38,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:47:38,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-20 07:47:38,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870000325] [2019-11-20 07:47:38,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:47:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:47:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:47:38,701 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-20 07:47:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:47:38,815 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-20 07:47:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 07:47:38,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-20 07:47:38,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 07:47:38,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-20 07:47:38,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-20 07:47:38,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-20 07:47:38,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-20 07:47:38,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 07:47:38,820 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-20 07:47:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-20 07:47:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-20 07:47:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 07:47:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-20 07:47:38,823 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-20 07:47:38,823 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-20 07:47:38,823 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 07:47:38,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-20 07:47:38,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 07:47:38,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 07:47:38,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 07:47:38,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:47:38,832 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 07:47:38,832 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 482#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; 483#L562 assume !(main_~array_size~0 < 1); 492#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 484#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 485#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 498#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 494#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 478#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 479#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 490#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 497#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 480#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 481#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 493#L551-3 [2019-11-20 07:47:38,832 INFO L796 eck$LassoCheckResult]: Loop: 493#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 501#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 489#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 493#L551-3 [2019-11-20 07:47:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2019-11-20 07:47:38,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384891895] [2019-11-20 07:47:38,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2019-11-20 07:47:38,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274017802] [2019-11-20 07:47:38,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2019-11-20 07:47:38,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:47:38,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413619481] [2019-11-20 07:47:38,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:47:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:47:38,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:47:39,357 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-11-20 07:47:39,444 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 07:47:39,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 07:47:39,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 07:47:39,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 07:47:39,444 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 07:47:39,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:39,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 07:47:39,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 07:47:39,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2019-11-20 07:47:39,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 07:47:39,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 07:47:39,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:39,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 07:47:40,020 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 07:47:40,021 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:40,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:40,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:40,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:40,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:40,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:40,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:40,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:40,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:47:40,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:40,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:40,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:40,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:40,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:40,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:40,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:40,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:40,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 07:47:40,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:40,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:40,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 07:47:40,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:40,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:40,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:40,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 07:47:40,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 07:47:40,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:40,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 07:47:40,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 07:47:40,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 07:47:40,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 07:47:40,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 07:47:40,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 07:47:40,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 07:47:40,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 07:47:40,113 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 07:47:40,113 INFO L444 ModelExtractionUtils]: 23 out of 37 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_418e744d-3a58-40d3-8401-5997f61b4bb1/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 07:47:40,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 07:47:40,120 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 07:47:40,120 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 07:47:40,121 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 Supporting invariants [] [2019-11-20 07:47:40,140 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 07:47:40,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 07:47:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:40,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 07:47:40,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 07:47:40,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-20 07:47:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 07:47:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 07:47:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 07:47:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 07:47:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:40,258 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 07:47:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:40,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 07:47:40,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 07:47:40,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-20 07:47:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 07:47:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 07:47:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-20 07:47:40,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 07:47:40,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:40,348 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 07:47:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:47:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:47:40,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:47:40,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:47:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:47:40,407 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 07:47:40,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 07:47:40,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2019-11-20 07:47:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 07:47:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 07:47:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-20 07:47:40,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 07:47:40,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:40,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-20 07:47:40,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:40,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-20 07:47:40,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 07:47:40,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-20 07:47:40,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 07:47:40,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-20 07:47:40,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 07:47:40,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 07:47:40,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 07:47:40,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 07:47:40,447 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:47:40,448 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:47:40,448 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:47:40,448 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 07:47:40,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 07:47:40,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 07:47:40,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 07:47:40,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 07:47:40 BoogieIcfgContainer [2019-11-20 07:47:40,454 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 07:47:40,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:47:40,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:47:40,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:47:40,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:47:34" (3/4) ... [2019-11-20 07:47:40,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:47:40,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:47:40,459 INFO L168 Benchmark]: Toolchain (without parser) took 6583.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 939.3 MB in the beginning and 900.1 MB in the end (delta: 39.2 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:47:40,459 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:47:40,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:47:40,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:47:40,461 INFO L168 Benchmark]: Boogie Preprocessor took 24.01 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. [2019-11-20 07:47:40,461 INFO L168 Benchmark]: RCFGBuilder took 295.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:47:40,462 INFO L168 Benchmark]: BuchiAutomizer took 5657.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 905.8 MB in the end (delta: 195.7 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:47:40,462 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.2 GB. Free memory is still 900.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:47:40,464 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 549.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.15 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. * Boogie Preprocessor took 24.01 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. * RCFGBuilder took 295.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5657.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 905.8 MB in the end (delta: 195.7 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.2 GB. Free memory is still 900.1 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 - 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 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * numbers + unknown-#length-unknown[numbers] + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * numbers + -4 * j + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 97 SDslu, 107 SDs, 0 SdLazy, 168 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax157 hnf98 lsp67 ukn80 mio100 lsp80 div100 bol100 ite100 ukn100 eq171 hnf90 smp89 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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...