./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/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_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/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.25-f470102 [2019-12-07 10:07:40,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:40,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:40,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:40,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:40,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:40,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:40,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:40,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:40,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:40,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:40,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:40,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:40,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:40,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:41,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:41,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:41,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:41,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:41,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:41,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:41,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:41,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:41,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:41,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:41,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:41,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:41,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:41,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:41,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:41,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:41,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:41,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:41,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:41,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:41,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:41,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:41,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:41,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:41,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:41,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:41,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 10:07:41,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:41,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:41,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:41,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:41,033 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:41,033 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 10:07:41,034 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 10:07:41,034 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 10:07:41,034 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 10:07:41,034 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 10:07:41,034 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 10:07:41,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:41,035 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:41,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:07:41,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:41,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:41,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:41,036 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 10:07:41,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:41,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 10:07:41,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:41,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:41,037 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 10:07:41,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:41,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:41,038 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:41,038 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 10:07:41,039 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 10:07:41,039 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_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/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-12-07 10:07:41,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:41,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:41,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:41,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:41,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:41,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-12-07 10:07:41,191 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/data/91e2b4123/5d0faad5552d416aa4a8c7c1f3f3e4a5/FLAGf199f0264 [2019-12-07 10:07:41,564 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:41,564 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2019-12-07 10:07:41,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/data/91e2b4123/5d0faad5552d416aa4a8c7c1f3f3e4a5/FLAGf199f0264 [2019-12-07 10:07:41,582 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/data/91e2b4123/5d0faad5552d416aa4a8c7c1f3f3e4a5 [2019-12-07 10:07:41,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:41,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:41,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:41,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:41,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:41,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eca2d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41, skipping insertion in model container [2019-12-07 10:07:41,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:41,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:41,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:41,848 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:41,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:41,904 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:41,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41 WrapperNode [2019-12-07 10:07:41,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:41,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:41,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:41,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:41,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:41,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:41,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:41,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:41,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:41,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:41,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:41,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:41,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/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-12-07 10:07:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:41,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:42,150 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:42,150 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 10:07:42,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42 BoogieIcfgContainer [2019-12-07 10:07:42,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:42,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 10:07:42,152 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 10:07:42,154 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 10:07:42,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:42,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 10:07:41" (1/3) ... [2019-12-07 10:07:42,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68e969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:42,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (2/3) ... [2019-12-07 10:07:42,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68e969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:42,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/3) ... [2019-12-07 10:07:42,156 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2019-12-07 10:07:42,186 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 10:07:42,186 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 10:07:42,186 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 10:07:42,186 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:42,186 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:42,186 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 10:07:42,186 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:42,186 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 10:07:42,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 10:07:42,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 10:07:42,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:42,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:42,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 10:07:42,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:07:42,213 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 10:07:42,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 10:07:42,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 10:07:42,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:42,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:42,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 10:07:42,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:07:42,220 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-12-07 10:07:42,220 INFO L796 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-12-07 10:07:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 10:07:42,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:42,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11352358] [2019-12-07 10:07:42,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-12-07 10:07:42,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:42,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438303501] [2019-12-07 10:07:42,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,325 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-12-07 10:07:42,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:42,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608114312] [2019-12-07 10:07:42,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:42,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:42,494 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:42,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:42,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:42,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:42,495 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:42,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:42,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:42,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2019-12-07 10:07:42,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:42,496 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:42,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:42,747 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:07:42,751 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,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-12-07 10:07:42,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:42,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:42,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:42,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,766 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-12-07 10:07:42,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:42,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:42,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:42,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,774 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-12-07 10:07:42,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:42,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:42,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,784 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-12-07 10:07:42,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:42,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:42,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,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-12-07 10:07:42,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:42,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:42,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:42,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,805 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-12-07 10:07:42,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:42,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:42,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:42,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,812 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-12-07 10:07:42,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:42,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:42,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:42,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,819 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-12-07 10:07:42,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:42,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:42,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:42,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:42,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:42,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:42,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:07:42,867 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-12-07 10:07:42,868 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:42,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:07:42,876 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 10:07:42,876 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:07:42,876 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-12-07 10:07:42,895 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 10:07:42,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:07:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:42,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:07:42,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:42,972 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-12-07 10:07:42,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-12-07 10:07:43,036 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-12-07 10:07:43,037 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-12-07 10:07:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:07:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-12-07 10:07:43,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 10:07:43,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:43,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-12-07 10:07:43,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:43,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-12-07 10:07:43,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:43,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2019-12-07 10:07:43,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 10:07:43,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2019-12-07 10:07:43,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 10:07:43,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:07:43,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-12-07 10:07:43,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:43,048 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 10:07:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-12-07 10:07:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 10:07:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 10:07:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-12-07 10:07:43,068 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 10:07:43,068 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 10:07:43,068 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 10:07:43,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-12-07 10:07:43,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 10:07:43,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:43,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:43,069 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,069 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:07:43,069 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#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; 121#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 122#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; 123#L528-3 assume !(main_~i~1 < main_~array_size~0); 127#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; 130#L515-3 [2019-12-07 10:07:43,070 INFO L796 eck$LassoCheckResult]: Loop: 130#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 129#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 131#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 130#L515-3 [2019-12-07 10:07:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-12-07 10:07:43,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560783801] [2019-12-07 10:07:43,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:43,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560783801] [2019-12-07 10:07:43,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:43,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013014762] [2019-12-07 10:07:43,117 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-12-07 10:07:43,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782478007] [2019-12-07 10:07:43,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:43,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782478007] [2019-12-07 10:07:43,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:43,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307356710] [2019-12-07 10:07:43,128 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 10:07:43,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:43,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:43,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:43,130 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-12-07 10:07:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,144 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-12-07 10:07:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:43,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-12-07 10:07:43,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 10:07:43,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 10:07:43,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 10:07:43,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-12-07 10:07:43,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:43,146 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:07:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-12-07 10:07:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 10:07:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:07:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 10:07:43,147 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:07:43,147 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:07:43,147 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 10:07:43,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-12-07 10:07:43,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:43,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:43,148 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,149 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#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; 156#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 157#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; 158#L528-3 assume !(main_~i~1 < main_~array_size~0); 162#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; 165#L515-3 [2019-12-07 10:07:43,149 INFO L796 eck$LassoCheckResult]: Loop: 165#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 166#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); 167#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 163#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 164#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 168#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 165#L515-3 [2019-12-07 10:07:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-12-07 10:07:43,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43736090] [2019-12-07 10:07:43,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:43,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43736090] [2019-12-07 10:07:43,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:43,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071918469] [2019-12-07 10:07:43,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2019-12-07 10:07:43,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124999376] [2019-12-07 10:07:43,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:43,275 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-12-07 10:07:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,290 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-12-07 10:07:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:43,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-12-07 10:07:43,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-12-07 10:07:43,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 10:07:43,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 10:07:43,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-12-07 10:07:43,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:43,292 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-12-07 10:07:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-12-07 10:07:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-12-07 10:07:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:07:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-12-07 10:07:43,294 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-12-07 10:07:43,294 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-12-07 10:07:43,294 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 10:07:43,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-12-07 10:07:43,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:43,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:43,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,295 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 191#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; 192#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 193#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; 194#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; 195#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 196#L528-3 assume !(main_~i~1 < main_~array_size~0); 198#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; 201#L515-3 [2019-12-07 10:07:43,295 INFO L796 eck$LassoCheckResult]: Loop: 201#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 202#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); 203#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 199#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 200#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 204#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 201#L515-3 [2019-12-07 10:07:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-12-07 10:07:43,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214989903] [2019-12-07 10:07:43,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2019-12-07 10:07:43,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065194627] [2019-12-07 10:07:43,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2019-12-07 10:07:43,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038167040] [2019-12-07 10:07:43,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:43,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038167040] [2019-12-07 10:07:43,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309246335] [2019-12-07 10:07:43,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:07:43,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:43,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:43,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 10:07:43,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517667005] [2019-12-07 10:07:43,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:43,505 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-12-07 10:07:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,558 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-12-07 10:07:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:07:43,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-12-07 10:07:43,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-12-07 10:07:43,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 10:07:43,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 10:07:43,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-12-07 10:07:43,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:43,560 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 10:07:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-12-07 10:07:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-12-07 10:07:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 10:07:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-12-07 10:07:43,562 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-12-07 10:07:43,562 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-12-07 10:07:43,562 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 10:07:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-12-07 10:07:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 10:07:43,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:43,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:43,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,563 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#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; 290#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 291#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; 292#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; 296#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 297#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; 293#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 294#L528-3 assume !(main_~i~1 < main_~array_size~0); 300#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; 301#L515-3 [2019-12-07 10:07:43,563 INFO L796 eck$LassoCheckResult]: Loop: 301#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 303#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); 304#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 298#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 299#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 302#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 301#L515-3 [2019-12-07 10:07:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-12-07 10:07:43,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011055540] [2019-12-07 10:07:43,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2019-12-07 10:07:43,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18951032] [2019-12-07 10:07:43,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2019-12-07 10:07:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838841054] [2019-12-07 10:07:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:43,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:43,810 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-12-07 10:07:43,864 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:43,864 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:43,864 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:43,864 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:43,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:43,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:43,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:43,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:43,864 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2019-12-07 10:07:43,864 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:43,864 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:43,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:43,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,171 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:07:44,171 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,174 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-12-07 10:07:44,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,181 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-12-07 10:07:44,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:44,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:44,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,189 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-12-07 10:07:44,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,196 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-12-07 10:07:44,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,204 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-12-07 10:07:44,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:44,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:44,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,212 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-12-07 10:07:44,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,219 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-12-07 10:07:44,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,226 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-12-07 10:07:44,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,233 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-12-07 10:07:44,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:44,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:44,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,243 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-12-07 10:07:44,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,251 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-12-07 10:07:44,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,257 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-12-07 10:07:44,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,263 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-12-07 10:07:44,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:44,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:44,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,272 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-12-07 10:07:44,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,279 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-12-07 10:07:44,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:44,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:44,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:44,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,285 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-12-07 10:07:44,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:44,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:44,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:44,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:44,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:44,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:44,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:07:44,332 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-12-07 10:07:44,332 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,335 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:07:44,339 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:07:44,339 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:07:44,339 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-12-07 10:07:44,348 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 10:07:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:44,396 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-12-07 10:07:44,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-12-07 10:07:44,411 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-12-07 10:07:44,411 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-12-07 10:07:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:07:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-12-07 10:07:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-12-07 10:07:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2019-12-07 10:07:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2019-12-07 10:07:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:44,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-12-07 10:07:44,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:44,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2019-12-07 10:07:44,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 10:07:44,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:07:44,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-12-07 10:07:44,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:07:44,415 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-12-07 10:07:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-12-07 10:07:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-12-07 10:07:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:07:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-12-07 10:07:44,417 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-12-07 10:07:44,417 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-12-07 10:07:44,417 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 10:07:44,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-12-07 10:07:44,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:44,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:44,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:44,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:44,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:07:44,418 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#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; 412#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 413#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; 414#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; 418#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 419#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; 415#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 416#L528-3 assume !(main_~i~1 < main_~array_size~0); 424#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; 425#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 421#L516-3 [2019-12-07 10:07:44,418 INFO L796 eck$LassoCheckResult]: Loop: 421#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); 426#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 420#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 421#L516-3 [2019-12-07 10:07:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-12-07 10:07:44,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:44,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823647422] [2019-12-07 10:07:44,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-12-07 10:07:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:44,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919682080] [2019-12-07 10:07:44,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,448 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-12-07 10:07:44,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:44,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635125378] [2019-12-07 10:07:44,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:44,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:44,668 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-07 10:07:44,710 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:44,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:44,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:44,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:44,711 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:44,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:44,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:44,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:44,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2019-12-07 10:07:44,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:44,711 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:44,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-12-07 10:07:44,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,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-12-07 10:07:44,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:44,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:45,024 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:07:45,024 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,027 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-12-07 10:07:45,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:45,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:45,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:45,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:45,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:45,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:45,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:45,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,034 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-12-07 10:07:45,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:45,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:45,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:45,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:45,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:45,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:45,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:45,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:45,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:45,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:45,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:45,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:45,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:45,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:45,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,048 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-12-07 10:07:45,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:45,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:45,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:45,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:45,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:45,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:45,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:45,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,056 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-12-07 10:07:45,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:45,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:45,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:45,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:45,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:45,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:45,073 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:07:45,099 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-12-07 10:07:45,099 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:07:45,103 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 10:07:45,103 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:07:45,103 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3) = -4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_3 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-12-07 10:07:45,114 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 10:07:45,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:07:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:07:45,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:07:45,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:45,177 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-12-07 10:07:45,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-12-07 10:07:45,219 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-12-07 10:07:45,219 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-12-07 10:07:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 10:07:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-12-07 10:07:45,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-12-07 10:07:45,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:45,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 10:07:45,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:45,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-12-07 10:07:45,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:45,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2019-12-07 10:07:45,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:45,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2019-12-07 10:07:45,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 10:07:45,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 10:07:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-12-07 10:07:45,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:07:45,222 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-12-07 10:07:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-12-07 10:07:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-12-07 10:07:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:07:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-12-07 10:07:45,223 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-12-07 10:07:45,223 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-12-07 10:07:45,223 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 10:07:45,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-12-07 10:07:45,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:45,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:45,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:45,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:45,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:07:45,224 INFO L794 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 564#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; 565#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 566#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; 567#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; 568#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 569#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; 571#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 583#L528-3 assume !(main_~i~1 < main_~array_size~0); 576#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; 577#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 579#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); 580#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 574#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 575#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 581#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 582#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 573#L516-3 [2019-12-07 10:07:45,225 INFO L796 eck$LassoCheckResult]: Loop: 573#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); 578#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 573#L516-3 [2019-12-07 10:07:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-12-07 10:07:45,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15732641] [2019-12-07 10:07:45,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:07:45,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15732641] [2019-12-07 10:07:45,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138077252] [2019-12-07 10:07:45,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:07:45,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:45,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:45,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-12-07 10:07:45,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953606101] [2019-12-07 10:07:45,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-12-07 10:07:45,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712250745] [2019-12-07 10:07:45,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:45,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:07:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:07:45,368 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-12-07 10:07:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:45,502 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-12-07 10:07:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:07:45,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2019-12-07 10:07:45,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:45,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 43 transitions. [2019-12-07 10:07:45,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 10:07:45,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-12-07 10:07:45,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-12-07 10:07:45,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:07:45,504 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-12-07 10:07:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-12-07 10:07:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-12-07 10:07:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 10:07:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-12-07 10:07:45,506 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-12-07 10:07:45,506 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-12-07 10:07:45,506 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 10:07:45,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-12-07 10:07:45,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:45,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:45,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:45,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:45,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:07:45,507 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#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; 714#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#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; 716#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; 717#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 718#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; 720#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 737#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; 733#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 732#L528-3 assume !(main_~i~1 < main_~array_size~0); 725#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; 726#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 728#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); 729#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 723#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 724#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); 735#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 736#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 734#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 730#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 731#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 722#L516-3 [2019-12-07 10:07:45,507 INFO L796 eck$LassoCheckResult]: Loop: 722#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); 727#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 721#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 722#L516-3 [2019-12-07 10:07:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 2 times [2019-12-07 10:07:45,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874635666] [2019-12-07 10:07:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-12-07 10:07:45,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259267729] [2019-12-07 10:07:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2019-12-07 10:07:45,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647093524] [2019-12-07 10:07:45,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:07:45,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647093524] [2019-12-07 10:07:45,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120787011] [2019-12-07 10:07:45,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_401a66e3-961d-42a0-8ae8-c5e6e35e9f7c/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:07:45,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:45,809 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 10:07:45,810 INFO L377 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-12-07 10:07:45,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:45,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:45,812 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:45,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-12-07 10:07:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:07:45,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:45,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-12-07 10:07:45,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185626878] [2019-12-07 10:07:45,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:07:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:07:45,880 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-12-07 10:07:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,023 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-12-07 10:07:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:07:46,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-12-07 10:07:46,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:07:46,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 51 transitions. [2019-12-07 10:07:46,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-12-07 10:07:46,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 10:07:46,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2019-12-07 10:07:46,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:07:46,025 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-12-07 10:07:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2019-12-07 10:07:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-12-07 10:07:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 10:07:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-12-07 10:07:46,027 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-12-07 10:07:46,027 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-12-07 10:07:46,027 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 10:07:46,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-12-07 10:07:46,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 10:07:46,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:46,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:46,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:07:46,028 INFO L794 eck$LassoCheckResult]: Stem: 890#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 884#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; 885#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 886#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; 887#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; 888#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 889#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; 891#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 910#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; 909#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 908#L528-3 assume !(main_~i~1 < main_~array_size~0); 896#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; 897#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 903#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); 914#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 894#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 895#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); 900#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 907#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 913#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 901#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 902#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 893#L516-3 [2019-12-07 10:07:46,028 INFO L796 eck$LassoCheckResult]: Loop: 893#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); 917#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 892#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 893#L516-3 [2019-12-07 10:07:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,028 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2019-12-07 10:07:46,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006166991] [2019-12-07 10:07:46,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-12-07 10:07:46,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069826001] [2019-12-07 10:07:46,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2019-12-07 10:07:46,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839080500] [2019-12-07 10:07:46,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,665 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 146 [2019-12-07 10:07:46,774 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 10:07:46,775 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:46,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:46,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:46,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:46,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:46,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:46,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:46,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2019-12-07 10:07:46,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:46,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:46,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,858 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) 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-12-07 10:07:46,860 INFO L168 Benchmark]: Toolchain (without parser) took 5275.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 940.9 MB in the beginning and 906.9 MB in the end (delta: 34.0 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:46,860 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:46,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:46,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.33 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-12-07 10:07:46,861 INFO L168 Benchmark]: Boogie Preprocessor took 18.15 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:46,861 INFO L168 Benchmark]: RCFGBuilder took 199.36 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:46,862 INFO L168 Benchmark]: BuchiAutomizer took 4707.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 906.9 MB in the end (delta: 159.8 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:46,864 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.33 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. * Boogie Preprocessor took 18.15 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.36 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4707.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 906.9 MB in the end (delta: 159.8 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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...