./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/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 32bit --witnessprinter.graph.data.programhash 862be090098a4271d6e1a31a6f1302665ccfc795 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:39:07,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:39:07,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:39:07,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:39:07,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:39:07,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:39:07,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:39:07,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:39:07,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:39:07,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:39:07,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:39:07,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:39:07,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:39:07,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:39:07,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:39:07,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:39:07,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:39:07,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:39:07,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:39:07,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:39:07,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:39:07,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:39:07,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:39:07,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:39:07,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:39:07,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:39:07,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:39:07,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:39:07,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:39:07,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:39:07,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:39:07,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:39:07,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:39:07,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:39:07,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:39:07,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:39:07,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:39:07,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:39:07,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:39:07,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:39:07,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:39:07,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:39:07,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:39:07,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:39:07,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:39:07,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:39:07,152 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:39:07,152 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:39:07,152 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:39:07,153 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:39:07,153 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:39:07,153 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:39:07,153 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:39:07,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:39:07,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:39:07,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:39:07,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:39:07,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:39:07,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:39:07,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:39:07,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:39:07,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:39:07,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:39:07,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:39:07,156 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:39:07,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:39:07,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:39:07,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:39:07,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:39:07,157 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:39:07,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:39:07,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:39:07,158 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:39:07,159 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:39:07,159 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_0bee4eed-d780-4157-9bed-e8312f17b10d/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2019-11-16 00:39:07,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:39:07,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:39:07,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:39:07,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:39:07,198 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:39:07,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-16 00:39:07,249 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/data/aa05822b6/3b0bbb70319c406684447b2acd438e12/FLAG8bda8129b [2019-11-16 00:39:07,720 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:39:07,720 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-11-16 00:39:07,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/data/aa05822b6/3b0bbb70319c406684447b2acd438e12/FLAG8bda8129b [2019-11-16 00:39:07,768 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/data/aa05822b6/3b0bbb70319c406684447b2acd438e12 [2019-11-16 00:39:07,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:39:07,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:39:07,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:07,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:39:07,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:39:07,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:07" (1/1) ... [2019-11-16 00:39:07,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10497a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:07, skipping insertion in model container [2019-11-16 00:39:07,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:07" (1/1) ... [2019-11-16 00:39:07,792 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:39:07,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:39:08,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:08,190 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:39:08,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:08,297 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:39:08,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08 WrapperNode [2019-11-16 00:39:08,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:08,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:08,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:39:08,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:39:08,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:08,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:39:08,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:39:08,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:39:08,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... [2019-11-16 00:39:08,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:39:08,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:39:08,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:39:08,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:39:08,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/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-16 00:39:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:39:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:39:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:39:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:39:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:39:08,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:39:08,666 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:39:08,667 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:39:08,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:08 BoogieIcfgContainer [2019-11-16 00:39:08,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:39:08,668 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:39:08,669 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:39:08,671 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:39:08,672 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:08,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:39:07" (1/3) ... [2019-11-16 00:39:08,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fc3a112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:08, skipping insertion in model container [2019-11-16 00:39:08,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:08,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:08" (2/3) ... [2019-11-16 00:39:08,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fc3a112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:08, skipping insertion in model container [2019-11-16 00:39:08,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:08,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:08" (3/3) ... [2019-11-16 00:39:08,676 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2019-11-16 00:39:08,715 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:39:08,716 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:39:08,716 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:39:08,716 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:39:08,716 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:39:08,716 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:39:08,716 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:39:08,717 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:39:08,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:39:08,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:08,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:08,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:08,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:39:08,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:08,756 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:39:08,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:39:08,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:08,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:08,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:08,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:39:08,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:08,764 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-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;main_~i~1 := 0; 4#L528-3true [2019-11-16 00:39:08,765 INFO L793 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 3#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 4#L528-3true [2019-11-16 00:39:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:39:08,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:08,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012740297] [2019-11-16 00:39:08,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,879 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-16 00:39:08,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:08,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699699612] [2019-11-16 00:39:08,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-16 00:39:08,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:08,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575232079] [2019-11-16 00:39:08,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:08,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:08,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:09,172 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:09,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:09,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:09,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:09,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:09,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:09,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:09,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:09,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2019-11-16 00:39:09,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:09,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:09,209 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-16 00:39:09,218 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-16 00:39:09,222 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-16 00:39:09,231 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-16 00:39:09,239 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-16 00:39:09,245 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-16 00:39:09,407 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-16 00:39:09,411 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-16 00:39:09,417 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-16 00:39:09,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:09,753 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:09,756 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-16 00:39:09,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:09,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:09,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:09,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,765 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-16 00:39:09,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:09,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:09,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:09,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,769 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-16 00:39:09,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,773 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:09,773 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:09,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,778 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-16 00:39:09,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,782 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:09,782 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:09,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,787 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-16 00:39:09,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:09,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:09,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:09,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,791 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-16 00:39:09,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:09,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:09,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:09,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,795 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-16 00:39:09,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:09,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:09,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:09,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:09,799 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-16 00:39:09,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:09,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:09,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:09,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:09,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:09,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:09,909 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:09,976 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:39:09,976 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:39:09,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:09,980 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:09,980 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:09,981 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-11-16 00:39:09,989 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:39:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:10,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:10,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:10,070 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-16 00:39:10,084 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-16 00:39:10,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-16 00:39:10,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2019-11-16 00:39:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:39:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-16 00:39:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:39:10,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:39:10,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:10,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:39:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:10,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2019-11-16 00:39:10,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:10,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2019-11-16 00:39:10,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:39:10,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:39:10,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-16 00:39:10,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:10,159 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-16 00:39:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-16 00:39:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:39:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:39:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-16 00:39:10,185 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-16 00:39:10,186 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-16 00:39:10,186 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:39:10,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-16 00:39:10,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:10,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:10,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:10,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:10,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:39:10,188 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 112#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#L523-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;main_~i~1 := 0; 114#L528-3 assume !(main_~i~1 < main_~array_size~0); 118#L528-4 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; 121#L515-3 [2019-11-16 00:39:10,188 INFO L793 eck$LassoCheckResult]: Loop: 121#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 120#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 122#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 121#L515-3 [2019-11-16 00:39:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-16 00:39:10,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040032999] [2019-11-16 00:39:10,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,244 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-16 00:39:10,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040032999] [2019-11-16 00:39:10,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:10,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:39:10,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143405702] [2019-11-16 00:39:10,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-11-16 00:39:10,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930634888] [2019-11-16 00:39:10,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,275 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-16 00:39:10,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930634888] [2019-11-16 00:39:10,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:10,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:39:10,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51837424] [2019-11-16 00:39:10,277 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:10,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:10,280 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:39:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:10,297 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-16 00:39:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:10,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-16 00:39:10,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:10,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-16 00:39:10,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:10,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:10,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-16 00:39:10,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:10,303 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-16 00:39:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-16 00:39:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-16 00:39:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:39:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-16 00:39:10,304 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-16 00:39:10,305 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-16 00:39:10,305 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:39:10,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-16 00:39:10,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:10,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:10,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:10,306 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:10,306 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:10,307 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 147#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 148#L523-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;main_~i~1 := 0; 149#L528-3 assume !(main_~i~1 < main_~array_size~0); 153#L528-4 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; 156#L515-3 [2019-11-16 00:39:10,307 INFO L793 eck$LassoCheckResult]: Loop: 156#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 157#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 158#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 154#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 155#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 159#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 156#L515-3 [2019-11-16 00:39:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-16 00:39:10,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389418689] [2019-11-16 00:39:10,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,342 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-16 00:39:10,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389418689] [2019-11-16 00:39:10,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:10,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:39:10,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568855059] [2019-11-16 00:39:10,343 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2019-11-16 00:39:10,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563111715] [2019-11-16 00:39:10,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:10,494 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-16 00:39:10,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:10,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:39:10,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:39:10,531 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:39:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:10,561 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-16 00:39:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:39:10,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-16 00:39:10,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:10,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-16 00:39:10,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:10,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:10,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-16 00:39:10,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:10,564 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-16 00:39:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-16 00:39:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-16 00:39:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:39:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-16 00:39:10,566 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:39:10,566 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:39:10,566 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:39:10,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-16 00:39:10,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:10,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:10,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:10,568 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:10,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:10,568 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 183#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 184#L523-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;main_~i~1 := 0; 185#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 186#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 187#L528-3 assume !(main_~i~1 < main_~array_size~0); 189#L528-4 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; 192#L515-3 [2019-11-16 00:39:10,568 INFO L793 eck$LassoCheckResult]: Loop: 192#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 193#L516-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); 194#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 190#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 191#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 195#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 192#L515-3 [2019-11-16 00:39:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-16 00:39:10,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917849160] [2019-11-16 00:39:10,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2019-11-16 00:39:10,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760082830] [2019-11-16 00:39:10,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:10,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2019-11-16 00:39:10,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:10,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768051200] [2019-11-16 00:39:10,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:10,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:10,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768051200] [2019-11-16 00:39:10,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653057668] [2019-11-16 00:39:10,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/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-16 00:39:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:10,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:39:10,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:10,871 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:39:10,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-16 00:39:10,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023272862] [2019-11-16 00:39:11,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:39:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:11,023 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-11-16 00:39:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:11,117 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-16 00:39:11,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:39:11,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-16 00:39:11,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:11,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-11-16 00:39:11,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:11,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:11,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-16 00:39:11,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:11,120 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-16 00:39:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-16 00:39:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-16 00:39:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:39:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-16 00:39:11,122 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-16 00:39:11,122 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-16 00:39:11,123 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:39:11,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-16 00:39:11,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:11,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:11,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:11,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:11,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:11,124 INFO L791 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 281#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 282#L523-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;main_~i~1 := 0; 283#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 284#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 285#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 287#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !(main_~i~1 < main_~array_size~0); 290#L528-4 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; 291#L515-3 [2019-11-16 00:39:11,124 INFO L793 eck$LassoCheckResult]: Loop: 291#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 292#L516-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); 293#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 288#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 289#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 294#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 291#L515-3 [2019-11-16 00:39:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-16 00:39:11,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:11,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954458534] [2019-11-16 00:39:11,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2019-11-16 00:39:11,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:11,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503273394] [2019-11-16 00:39:11,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,154 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:11,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2019-11-16 00:39:11,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:11,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031086508] [2019-11-16 00:39:11,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:11,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:11,184 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:11,286 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-16 00:39:11,602 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-11-16 00:39:11,696 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:11,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:11,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:11,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:11,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:11,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:11,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:11,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:11,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2019-11-16 00:39:11,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:11,697 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:11,702 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-16 00:39:11,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:11,713 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-16 00:39:11,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:11,722 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-16 00:39:11,726 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-16 00:39:11,729 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-16 00:39:11,731 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-16 00:39:11,733 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-16 00:39:11,737 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-16 00:39:11,741 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-16 00:39:11,743 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-16 00:39:11,746 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-16 00:39:11,749 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-16 00:39:11,752 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-16 00:39:11,930 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-16 00:39:11,980 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-16 00:39:12,393 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:12,393 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:12,394 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-16 00:39:12,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,396 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-16 00:39:12,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:12,398 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:12,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,400 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-16 00:39:12,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,403 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-16 00:39:12,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,406 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-16 00:39:12,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,408 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:12,408 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:12,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,411 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-16 00:39:12,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,413 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-16 00:39:12,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,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-16 00:39:12,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,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-16 00:39:12,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:12,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:12,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,423 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-16 00:39:12,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,426 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-16 00:39:12,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,427 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,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-16 00:39:12,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,431 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-16 00:39:12,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:12,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:12,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,435 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-16 00:39:12,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,438 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-16 00:39:12,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:12,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:12,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:12,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:12,441 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-16 00:39:12,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:12,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:12,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:12,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:12,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:12,447 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:12,501 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:12,535 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:39:12,535 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:39:12,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:12,537 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:12,537 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:12,538 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-16 00:39:12,555 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:39:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:12,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:12,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:12,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:12,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:12,623 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-16 00:39:12,624 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-16 00:39:12,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:39:12,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 4 states. [2019-11-16 00:39:12,644 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-16 00:39:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:39:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-16 00:39:12,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:39:12,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:12,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-16 00:39:12,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:12,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-16 00:39:12,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:12,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-11-16 00:39:12,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:12,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2019-11-16 00:39:12,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:39:12,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:39:12,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-16 00:39:12,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:12,647 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-16 00:39:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-16 00:39:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-16 00:39:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:39:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-16 00:39:12,649 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:39:12,650 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:39:12,650 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:39:12,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-16 00:39:12,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:12,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:12,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:12,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:12,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:39:12,652 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 402#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 403#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 404#L523-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;main_~i~1 := 0; 405#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 409#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 410#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 406#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 407#L528-3 assume !(main_~i~1 < main_~array_size~0); 415#L528-4 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; 416#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 412#L516-3 [2019-11-16 00:39:12,652 INFO L793 eck$LassoCheckResult]: Loop: 412#L516-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); 417#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 411#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 412#L516-3 [2019-11-16 00:39:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-16 00:39:12,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:12,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061002663] [2019-11-16 00:39:12,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-16 00:39:12,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:12,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16504435] [2019-11-16 00:39:12,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-16 00:39:12,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:12,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617038921] [2019-11-16 00:39:12,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:12,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:12,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:13,004 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-11-16 00:39:13,082 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:13,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:13,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:13,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:13,082 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:13,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:13,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:13,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:13,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2019-11-16 00:39:13,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:13,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:13,086 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-16 00:39:13,094 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-16 00:39:13,096 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-16 00:39:13,224 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-16 00:39:13,277 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-16 00:39:13,280 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-16 00:39:13,282 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-16 00:39:13,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:13,287 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-16 00:39:13,293 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-16 00:39:13,296 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-16 00:39:13,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:13,300 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-16 00:39:13,303 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-16 00:39:13,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:13,313 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-16 00:39:13,318 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-16 00:39:13,452 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-16 00:39:13,720 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:13,720 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:13,720 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-16 00:39:13,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:13,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:13,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:13,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:13,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:13,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:13,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:13,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:13,722 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-16 00:39:13,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:13,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:13,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:13,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:13,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:13,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:13,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:13,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:13,724 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-16 00:39:13,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:13,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:13,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:13,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:13,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:13,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:13,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:13,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:13,733 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-16 00:39:13,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:13,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:13,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:13,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:13,736 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:13,737 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:13,773 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:13,811 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:39:13,812 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:39:13,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:13,814 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-16 00:39:13,814 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:13,814 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-11-16 00:39:13,831 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:39:13,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:39:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:13,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:39:13,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:13,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:39:13,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:13,966 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-16 00:39:13,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-16 00:39:13,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-16 00:39:14,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 36 states and 50 transitions. Complement of second has 9 states. [2019-11-16 00:39:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:39:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-11-16 00:39:14,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-16 00:39:14,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:14,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-16 00:39:14,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:14,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-16 00:39:14,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:14,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2019-11-16 00:39:14,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:14,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2019-11-16 00:39:14,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:39:14,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:39:14,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-16 00:39:14,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:14,055 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-16 00:39:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-16 00:39:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-11-16 00:39:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:39:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-16 00:39:14,059 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:39:14,059 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:39:14,059 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:39:14,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-16 00:39:14,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:14,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:14,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:14,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:14,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:39:14,065 INFO L791 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 556#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 557#L523-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;main_~i~1 := 0; 558#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 559#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 560#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 562#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 574#L528-3 assume !(main_~i~1 < main_~array_size~0); 567#L528-4 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; 568#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 570#L516-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); 571#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 565#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 566#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 572#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 573#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 564#L516-3 [2019-11-16 00:39:14,066 INFO L793 eck$LassoCheckResult]: Loop: 564#L516-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); 569#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 563#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 564#L516-3 [2019-11-16 00:39:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-11-16 00:39:14,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:14,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398717338] [2019-11-16 00:39:14,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:39:14,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398717338] [2019-11-16 00:39:14,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163265123] [2019-11-16 00:39:14,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/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-16 00:39:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:14,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:39:14,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:14,277 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:39:14,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-11-16 00:39:14,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602845147] [2019-11-16 00:39:14,278 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-16 00:39:14,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:14,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583698995] [2019-11-16 00:39:14,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:14,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:39:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:39:14,410 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-16 00:39:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:14,656 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-16 00:39:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:39:14,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2019-11-16 00:39:14,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:14,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 43 transitions. [2019-11-16 00:39:14,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:39:14,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-16 00:39:14,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-11-16 00:39:14,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:14,659 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-16 00:39:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-11-16 00:39:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-11-16 00:39:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:39:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-16 00:39:14,662 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-16 00:39:14,662 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-16 00:39:14,662 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:39:14,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-16 00:39:14,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:14,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:14,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:14,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:14,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:39:14,687 INFO L791 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 704#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 705#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 706#L523-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;main_~i~1 := 0; 707#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 708#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 709#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 711#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 728#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 724#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 723#L528-3 assume !(main_~i~1 < main_~array_size~0); 716#L528-4 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; 717#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 719#L516-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); 720#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 714#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 715#L516-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); 726#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 727#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 725#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 721#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 722#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 713#L516-3 [2019-11-16 00:39:14,687 INFO L793 eck$LassoCheckResult]: Loop: 713#L516-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); 718#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 712#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 713#L516-3 [2019-11-16 00:39:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 2 times [2019-11-16 00:39:14,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:14,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336818035] [2019-11-16 00:39:14,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-16 00:39:14,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:14,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905407603] [2019-11-16 00:39:14,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:14,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2019-11-16 00:39:14,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:14,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137095076] [2019-11-16 00:39:14,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:14,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:39:15,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137095076] [2019-11-16 00:39:15,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582835469] [2019-11-16 00:39:15,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bee4eed-d780-4157-9bed-e8312f17b10d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:39:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:15,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:39:15,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:15,251 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:39:15,252 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-16 00:39:15,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:15,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:15,255 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-16 00:39:15,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-16 00:39:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:39:15,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:39:15,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-16 00:39:15,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773680254] [2019-11-16 00:39:15,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:39:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:39:15,355 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-11-16 00:39:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:15,599 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-16 00:39:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:39:15,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-16 00:39:15,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:39:15,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 51 transitions. [2019-11-16 00:39:15,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:39:15,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:39:15,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2019-11-16 00:39:15,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:15,602 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-16 00:39:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2019-11-16 00:39:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-16 00:39:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:39:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-16 00:39:15,605 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-16 00:39:15,605 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-16 00:39:15,605 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:39:15,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-11-16 00:39:15,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:39:15,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:15,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:15,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:15,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:39:15,607 INFO L791 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 876#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 877#L523-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;main_~i~1 := 0; 878#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 879#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 880#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 882#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 901#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 900#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 899#L528-3 assume !(main_~i~1 < main_~array_size~0); 887#L528-4 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; 888#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 894#L516-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); 905#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 885#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 886#L516-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); 891#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 898#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 904#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 892#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 893#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 884#L516-3 [2019-11-16 00:39:15,607 INFO L793 eck$LassoCheckResult]: Loop: 884#L516-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); 908#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 883#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 884#L516-3 [2019-11-16 00:39:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2019-11-16 00:39:15,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:15,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732036184] [2019-11-16 00:39:15,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-11-16 00:39:15,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:15,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632574064] [2019-11-16 00:39:15,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2019-11-16 00:39:15,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:15,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158243685] [2019-11-16 00:39:15,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:15,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:15,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:16,614 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 147 [2019-11-16 00:39:16,739 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:39:16,742 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:16,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:16,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:16,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:16,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:16,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:16,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:16,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:16,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2019-11-16 00:39:16,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:16,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:16,746 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-16 00:39:16,754 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-16 00:39:16,766 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-16 00:39:16,873 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:39:16,878 INFO L168 Benchmark]: Toolchain (without parser) took 9104.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -64.9 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:16,878 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:16,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:16,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:16,880 INFO L168 Benchmark]: Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:16,880 INFO L168 Benchmark]: RCFGBuilder took 299.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:16,880 INFO L168 Benchmark]: BuchiAutomizer took 8208.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:16,884 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8208.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...