./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/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 af6d3df1a288680024c52d2d61adb02fdd276fce ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:52:29,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:52:29,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:52:29,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:52:29,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:52:29,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:52:29,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:52:29,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:52:29,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:52:29,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:52:29,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:52:29,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:52:29,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:52:29,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:52:29,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:52:29,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:52:29,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:52:29,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:52:29,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:52:29,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:52:29,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:52:29,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:52:29,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:52:29,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:52:29,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:52:29,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:52:29,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:52:29,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:52:29,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:52:29,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:52:29,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:52:29,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:52:29,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:52:29,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:52:29,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:52:29,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:52:29,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:52:29,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:52:29,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:52:29,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:52:29,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:52:29,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:52:29,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:52:29,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:52:29,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:52:29,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:52:29,306 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:52:29,306 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:52:29,306 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:52:29,307 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:52:29,307 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:52:29,307 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:52:29,307 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:52:29,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:52:29,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:52:29,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:52:29,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:52:29,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:52:29,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:52:29,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:52:29,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:52:29,309 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:52:29,310 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:52:29,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:52:29,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:52:29,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:52:29,311 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:52:29,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:52:29,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:52:29,311 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:52:29,312 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:52:29,313 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_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/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 -> af6d3df1a288680024c52d2d61adb02fdd276fce [2019-11-15 20:52:29,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:52:29,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:52:29,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:52:29,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:52:29,351 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:52:29,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-15 20:52:29,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/data/72cd5a705/23ef968ecfaf4772bb81b43c784d96b2/FLAG28ab6bfb7 [2019-11-15 20:52:29,876 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:52:29,877 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-15 20:52:29,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/data/72cd5a705/23ef968ecfaf4772bb81b43c784d96b2/FLAG28ab6bfb7 [2019-11-15 20:52:29,899 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/data/72cd5a705/23ef968ecfaf4772bb81b43c784d96b2 [2019-11-15 20:52:29,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:52:29,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:52:29,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:52:29,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:52:29,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:52:29,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:52:29" (1/1) ... [2019-11-15 20:52:29,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda6529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:29, skipping insertion in model container [2019-11-15 20:52:29,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:52:29" (1/1) ... [2019-11-15 20:52:29,916 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:52:29,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:52:30,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:52:30,316 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:52:30,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:52:30,406 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:52:30,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30 WrapperNode [2019-11-15 20:52:30,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:52:30,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:52:30,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:52:30,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:52:30,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:52:30,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:52:30,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:52:30,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:52:30,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... [2019-11-15 20:52:30,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:52:30,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:52:30,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:52:30,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:52:30,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/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-15 20:52:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:52:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:52:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:52:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:52:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:52:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:52:30,838 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:52:30,838 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:52:30,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:30 BoogieIcfgContainer [2019-11-15 20:52:30,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:52:30,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:52:30,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:52:30,843 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:52:30,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:52:30,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:52:29" (1/3) ... [2019-11-15 20:52:30,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a8a281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:52:30, skipping insertion in model container [2019-11-15 20:52:30,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:52:30,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:30" (2/3) ... [2019-11-15 20:52:30,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a8a281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:52:30, skipping insertion in model container [2019-11-15 20:52:30,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:52:30,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:30" (3/3) ... [2019-11-15 20:52:30,847 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2019-11-15 20:52:30,889 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:52:30,889 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:52:30,889 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:52:30,889 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:52:30,891 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:52:30,891 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:52:30,891 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:52:30,891 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:52:30,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 20:52:30,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:52:30,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:30,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:30,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:52:30,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:30,930 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:52:30,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 20:52:30,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:52:30,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:30,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:30,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:52:30,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:30,939 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2019-11-15 20:52:30,940 INFO L793 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2019-11-15 20:52:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 20:52:30,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:30,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983310452] [2019-11-15 20:52:30,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:30,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:30,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-15 20:52:31,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096489422] [2019-11-15 20:52:31,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:31,099 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-15 20:52:31,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096489422] [2019-11-15 20:52:31,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:31,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:52:31,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428742228] [2019-11-15 20:52:31,104 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:52:31,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:52:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:52:31,121 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-15 20:52:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:31,127 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-15 20:52:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:52:31,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 20:52:31,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:52:31,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-15 20:52:31,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 20:52:31,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 20:52:31,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-15 20:52:31,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:52:31,136 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 20:52:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-15 20:52:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 20:52:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 20:52:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-15 20:52:31,161 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 20:52:31,161 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 20:52:31,161 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:52:31,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-15 20:52:31,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:52:31,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:31,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:31,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:52:31,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:31,163 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2019-11-15 20:52:31,163 INFO L793 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2019-11-15 20:52:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-15 20:52:31,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911986464] [2019-11-15 20:52:31,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-15 20:52:31,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629867567] [2019-11-15 20:52:31,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:31,225 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-15 20:52:31,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629867567] [2019-11-15 20:52:31,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:31,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:52:31,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687858712] [2019-11-15 20:52:31,226 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:52:31,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:31,227 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 20:52:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:31,263 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-11-15 20:52:31,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:31,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-11-15 20:52:31,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:52:31,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 20:52:31,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:52:31,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:52:31,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-15 20:52:31,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:52:31,266 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 20:52:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-15 20:52:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 20:52:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 20:52:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 20:52:31,268 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 20:52:31,268 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 20:52:31,268 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:52:31,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 20:52:31,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:52:31,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:31,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:31,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:52:31,269 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:52:31,269 INFO L791 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2019-11-15 20:52:31,270 INFO L793 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2019-11-15 20:52:31,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-15 20:52:31,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552646034] [2019-11-15 20:52:31,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,317 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-11-15 20:52:31,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669082876] [2019-11-15 20:52:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,342 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-11-15 20:52:31,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:31,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231950308] [2019-11-15 20:52:31,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:31,407 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:31,540 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-15 20:52:31,751 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:52:31,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:52:31,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:52:31,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:52:31,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:52:31,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:52:31,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:52:31,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:52:31,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2019-11-15 20:52:31,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:52:31,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:52:31,787 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-15 20:52:31,793 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-15 20:52:31,796 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-15 20:52:31,800 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-15 20:52:31,806 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-15 20:52:31,810 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-15 20:52:31,938 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 20:52:31,978 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-15 20:52:31,981 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-15 20:52:31,984 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-15 20:52:31,987 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-15 20:52:31,989 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-15 20:52:31,992 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-15 20:52:31,999 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-15 20:52:32,001 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-15 20:52:32,373 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 20:52:32,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:52:32,516 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:52:32,518 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-15 20:52:32,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,525 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-15 20:52:32,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,528 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-15 20:52:32,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,531 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-15 20:52:32,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:32,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:32,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,546 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-15 20:52:32,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,557 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-15 20:52:32,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,560 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,569 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-15 20:52:32,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,570 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:52:32,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,575 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:52:32,575 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:32,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,596 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-15 20:52:32,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:32,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:32,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:32,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,599 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-15 20:52:32,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,602 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:32,602 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:32,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:32,612 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-15 20:52:32,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:32,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:32,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:32,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:32,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:32,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:32,696 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:52:32,795 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:52:32,795 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:52:32,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:52:32,800 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:52:32,800 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:52:32,801 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-15 20:52:32,820 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 20:52:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:32,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:32,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:32,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:52:32,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:52:32,905 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-15 20:52:32,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 20:52:32,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2019-11-15 20:52:32,945 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-15 20:52:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:52:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 20:52:32,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 20:52:32,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:32,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 20:52:32,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:32,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-15 20:52:32,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:32,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-15 20:52:32,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:32,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-11-15 20:52:32,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 20:52:32,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 20:52:32,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-15 20:52:32,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:52:32,954 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 20:52:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-15 20:52:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 20:52:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:52:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-15 20:52:32,957 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 20:52:32,957 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 20:52:32,957 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:52:32,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-15 20:52:32,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:32,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:32,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:32,961 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:52:32,961 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:32,961 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L558 assume !(main_~array_size~0 < 1); 159#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 161#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 153#L551-3 [2019-11-15 20:52:32,961 INFO L793 eck$LassoCheckResult]: Loop: 153#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 154#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 162#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 153#L551-3 [2019-11-15 20:52:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-15 20:52:32,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:32,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733854254] [2019-11-15 20:52:32,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:32,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-15 20:52:32,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:32,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637502390] [2019-11-15 20:52:32,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:32,993 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-15 20:52:32,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:32,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715394757] [2019-11-15 20:52:32,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:32,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:33,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:33,317 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 20:52:33,381 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:52:33,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:52:33,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:52:33,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:52:33,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:52:33,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:52:33,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:52:33,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:52:33,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2019-11-15 20:52:33,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:52:33,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:52:33,386 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-15 20:52:33,392 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-15 20:52:33,396 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-15 20:52:33,401 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-15 20:52:33,530 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-15 20:52:33,584 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-15 20:52:33,587 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-15 20:52:33,590 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-15 20:52:33,591 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-15 20:52:33,594 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-15 20:52:33,595 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-15 20:52:33,597 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-15 20:52:33,599 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-15 20:52:33,601 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-15 20:52:33,603 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-15 20:52:33,974 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:52:33,974 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:52:33,974 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-15 20:52:33,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:33,975 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:33,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:33,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:33,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:33,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:33,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:33,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:33,976 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-15 20:52:33,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:33,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:33,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:33,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:33,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:33,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:33,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:33,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:33,978 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-15 20:52:33,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:33,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:33,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:33,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:33,980 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:33,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:33,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:33,993 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-15 20:52:33,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:33,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:33,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:33,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:33,997 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:33,998 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:34,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:34,010 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-15 20:52:34,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:34,012 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:52:34,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:34,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:34,015 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:52:34,015 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:34,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:34,040 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-15 20:52:34,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:34,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:34,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:34,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:34,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:34,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:34,111 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:52:34,143 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:52:34,144 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:52:34,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:52:34,146 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:52:34,146 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:52:34,147 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-15 20:52:34,156 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 20:52:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:34,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:52:34,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:34,210 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-15 20:52:34,211 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-15 20:52:34,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 20:52:34,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-11-15 20:52:34,237 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-15 20:52:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:52:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 20:52:34,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 20:52:34,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:34,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 20:52:34,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:34,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 20:52:34,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:34,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-11-15 20:52:34,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:34,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-11-15 20:52:34,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 20:52:34,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 20:52:34,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-15 20:52:34,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:52:34,242 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 20:52:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-15 20:52:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-11-15 20:52:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:52:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 20:52:34,243 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 20:52:34,243 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 20:52:34,243 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:52:34,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 20:52:34,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:34,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:34,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:34,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:34,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:34,246 INFO L791 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 266#L558 assume !(main_~array_size~0 < 1); 267#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 268#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 261#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 262#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 271#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 272#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 263#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 264#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 259#L551-3 [2019-11-15 20:52:34,246 INFO L793 eck$LassoCheckResult]: Loop: 259#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 260#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 270#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 259#L551-3 [2019-11-15 20:52:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-15 20:52:34,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:34,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148005245] [2019-11-15 20:52:34,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:52:34,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148005245] [2019-11-15 20:52:34,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601314737] [2019-11-15 20:52:34,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:52:34,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:52:34,370 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:52:34,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 20:52:34,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190145909] [2019-11-15 20:52:34,371 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:52:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-15 20:52:34,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:34,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52193379] [2019-11-15 20:52:34,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:34,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:52:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:52:34,502 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-15 20:52:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:34,576 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-15 20:52:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:52:34,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-15 20:52:34,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:34,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-11-15 20:52:34,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 20:52:34,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:52:34,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-15 20:52:34,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:52:34,579 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 20:52:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-15 20:52:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 20:52:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:52:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 20:52:34,581 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 20:52:34,581 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 20:52:34,581 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:52:34,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 20:52:34,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:34,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:34,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:34,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:34,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:34,583 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 351#L558 assume !(main_~array_size~0 < 1); 352#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 353#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 346#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 347#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 356#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 357#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 360#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 348#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 349#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 344#L551-3 [2019-11-15 20:52:34,583 INFO L793 eck$LassoCheckResult]: Loop: 344#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 345#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 355#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 344#L551-3 [2019-11-15 20:52:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-15 20:52:34,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:34,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856115193] [2019-11-15 20:52:34,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,603 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-15 20:52:34,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:34,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325924904] [2019-11-15 20:52:34,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:34,612 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-11-15 20:52:34,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:34,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030770611] [2019-11-15 20:52:34,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:34,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,884 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-15 20:52:34,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030770611] [2019-11-15 20:52:34,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879833722] [2019-11-15 20:52:34,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96da3d05-1a2a-4ac6-bff2-c913bfb2b814/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:34,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:52:34,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:35,041 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 20:52:35,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 20:52:35,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:52:35,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:52:35,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:52:35,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-15 20:52:35,065 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-15 20:52:35,065 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:52:35,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-15 20:52:35,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035156080] [2019-11-15 20:52:35,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:52:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:52:35,175 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-15 20:52:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:35,299 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-15 20:52:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:52:35,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-15 20:52:35,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:52:35,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-15 20:52:35,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 20:52:35,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 20:52:35,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-15 20:52:35,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:52:35,303 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-15 20:52:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-15 20:52:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-15 20:52:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:52:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-15 20:52:35,305 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 20:52:35,306 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 20:52:35,306 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:52:35,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-15 20:52:35,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:52:35,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:52:35,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:52:35,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:35,307 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:52:35,307 INFO L791 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 472#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; 473#L558 assume !(main_~array_size~0 < 1); 476#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 477#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 478#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 491#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 487#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 470#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 471#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 485#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 490#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 474#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 475#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 468#L551-3 [2019-11-15 20:52:35,307 INFO L793 eck$LassoCheckResult]: Loop: 468#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 469#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 484#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 468#L551-3 [2019-11-15 20:52:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-11-15 20:52:35,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:35,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657370455] [2019-11-15 20:52:35,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-15 20:52:35,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:35,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289839413] [2019-11-15 20:52:35,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,335 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-11-15 20:52:35,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:35,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962561151] [2019-11-15 20:52:35,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:35,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:52:35,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:52:35,761 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2019-11-15 20:52:35,843 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:52:35,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:52:35,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:52:35,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:52:35,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:52:35,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:52:35,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:52:35,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:52:35,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2019-11-15 20:52:35,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:52:35,844 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:52:35,846 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-15 20:52:35,850 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-15 20:52:35,857 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-15 20:52:36,095 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-15 20:52:36,098 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-15 20:52:36,100 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-15 20:52:36,101 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-15 20:52:36,103 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-15 20:52:36,111 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-15 20:52:36,113 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-15 20:52:36,114 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-15 20:52:36,117 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-15 20:52:36,118 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-15 20:52:36,120 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-15 20:52:36,413 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:52:36,414 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:52:36,414 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-15 20:52:36,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:36,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:52:36,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:36,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:36,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:36,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:52:36,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:52:36,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:36,416 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-15 20:52:36,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:36,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:36,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:36,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:36,417 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:36,417 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:36,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:36,419 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-15 20:52:36,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:36,419 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:52:36,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:36,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:36,422 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:52:36,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:36,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:52:36,428 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-15 20:52:36,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:52:36,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:52:36,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:52:36,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:52:36,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:52:36,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:52:36,467 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:52:36,514 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 20:52:36,514 INFO L444 ModelExtractionUtils]: 26 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 20:52:36,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:52:36,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:52:36,516 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:52:36,516 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-15 20:52:36,533 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 20:52:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,588 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-15 20:52:36,588 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-15 20:52:36,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:52:36,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2019-11-15 20:52:36,611 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-15 20:52:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:52:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 20:52:36,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:52:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:36,612 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:52:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,659 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-15 20:52:36,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:52:36,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:52:36,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2019-11-15 20:52:36,677 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-15 20:52:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:52:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 20:52:36,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:52:36,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:36,678 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:52:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:36,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:52:36,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:36,718 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-15 20:52:36,718 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:52:36,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:52:36,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 58 transitions. Complement of second has 6 states. [2019-11-15 20:52:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:52:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:52:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 20:52:36,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:52:36,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:36,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 20:52:36,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:36,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 20:52:36,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:52:36,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-15 20:52:36,756 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:52:36,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 20:52:36,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:52:36,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:52:36,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:52:36,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:52:36,757 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:52:36,757 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:52:36,757 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:52:36,757 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:52:36,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:52:36,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:52:36,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:52:36,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:52:36 BoogieIcfgContainer [2019-11-15 20:52:36,764 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:52:36,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:52:36,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:52:36,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:52:36,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:30" (3/4) ... [2019-11-15 20:52:36,767 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:52:36,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:52:36,768 INFO L168 Benchmark]: Toolchain (without parser) took 6866.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 940.7 MB in the beginning and 897.9 MB in the end (delta: 42.8 MB). Peak memory consumption was 238.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:36,769 INFO L168 Benchmark]: CDTParser took 0.22 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-15 20:52:36,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:36,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:52:36,770 INFO L168 Benchmark]: Boogie Preprocessor took 26.16 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-15 20:52:36,771 INFO L168 Benchmark]: RCFGBuilder took 367.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:36,772 INFO L168 Benchmark]: BuchiAutomizer took 5924.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 897.9 MB in the end (delta: 208.5 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:36,772 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.2 GB. Free memory is still 897.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:52:36,775 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.22 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 504.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.16 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 367.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5924.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 897.9 MB in the end (delta: 208.5 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.2 GB. Free memory is still 897.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 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: 1/1 HoareTripleCheckerStatistics: 85 SDtfs, 77 SDslu, 74 SDs, 0 SdLazy, 158 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital194 mio100 ax109 hnf99 lsp88 ukn62 mio100 lsp63 div100 bol100 ite100 ukn100 eq178 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...