./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 02:58:29,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:58:29,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:58:29,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:58:29,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:58:29,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:58:29,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:58:29,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:58:29,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:58:29,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:58:29,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:58:29,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:58:29,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:58:29,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:58:29,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:58:30,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:58:30,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:58:30,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:58:30,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:58:30,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:58:30,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:58:30,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:58:30,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:58:30,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:58:30,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:58:30,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:58:30,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:58:30,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:58:30,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:58:30,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:58:30,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:58:30,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:58:30,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:58:30,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:58:30,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:58:30,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:58:30,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:58:30,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:58:30,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:58:30,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:58:30,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:58:30,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-11-28 02:58:30,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:58:30,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:58:30,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:58:30,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:58:30,106 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:58:30,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:58:30,107 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:58:30,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 02:58:30,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:58:30,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:58:30,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:58:30,109 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-28 02:58:30,109 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-28 02:58:30,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:58:30,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 02:58:30,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:58:30,110 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:58:30,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:58:30,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:58:30,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:58:30,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:58:30,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:58:30,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:58:30,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:58:30,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:58:30,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:58:30,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:58:30,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_ceff074b-bca0-430c-856a-5f975587a0a2/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(G valid-memcleanup) ) 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 -> c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 [2020-11-28 02:58:30,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:58:30,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:58:30,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:58:30,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:58:30,525 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:58:30,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-11-28 02:58:30,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/data/35642ce91/2340eee237cb460193260aee2e7c376b/FLAGad06a5793 [2020-11-28 02:58:31,133 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:58:31,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-11-28 02:58:31,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/data/35642ce91/2340eee237cb460193260aee2e7c376b/FLAGad06a5793 [2020-11-28 02:58:31,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/data/35642ce91/2340eee237cb460193260aee2e7c376b [2020-11-28 02:58:31,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:58:31,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-28 02:58:31,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:58:31,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:58:31,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:58:31,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:31" (1/1) ... [2020-11-28 02:58:31,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e70e392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:31, skipping insertion in model container [2020-11-28 02:58:31,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:31" (1/1) ... [2020-11-28 02:58:31,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:58:31,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:58:31,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:58:31,901 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:58:31,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:58:32,037 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:58:32,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32 WrapperNode [2020-11-28 02:58:32,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:58:32,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:58:32,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:58:32,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:58:32,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... [2020-11-28 02:58:32,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:58:32,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:58:32,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:58:32,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:58:32,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:58:32,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-28 02:58:32,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:58:32,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-28 02:58:32,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-28 02:58:32,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-28 02:58:32,213 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-28 02:58:32,213 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-11-28 02:58:32,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-28 02:58:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-28 02:58:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-28 02:58:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-28 02:58:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-28 02:58:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-28 02:58:32,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:58:32,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-28 02:58:32,215 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-28 02:58:32,215 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-28 02:58:32,215 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-28 02:58:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-28 02:58:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-28 02:58:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-28 02:58:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-28 02:58:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-28 02:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-28 02:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-28 02:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-28 02:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-28 02:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-28 02:58:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-28 02:58:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-28 02:58:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-28 02:58:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-28 02:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-28 02:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-28 02:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-28 02:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-28 02:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-28 02:58:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-28 02:58:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-28 02:58:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-28 02:58:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-28 02:58:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-28 02:58:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-28 02:58:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-28 02:58:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-28 02:58:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-28 02:58:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-28 02:58:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-28 02:58:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-28 02:58:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-28 02:58:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-28 02:58:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-28 02:58:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-28 02:58:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-28 02:58:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-28 02:58:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-28 02:58:32,223 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-28 02:58:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-28 02:58:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-28 02:58:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-28 02:58:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-28 02:58:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-28 02:58:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-28 02:58:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-28 02:58:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-28 02:58:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-28 02:58:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-28 02:58:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-28 02:58:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-28 02:58:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-28 02:58:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-28 02:58:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-28 02:58:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-28 02:58:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-28 02:58:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-28 02:58:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-28 02:58:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-28 02:58:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-28 02:58:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-28 02:58:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-28 02:58:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-28 02:58:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-28 02:58:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-28 02:58:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-28 02:58:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-28 02:58:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-28 02:58:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-28 02:58:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-28 02:58:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-28 02:58:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-28 02:58:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-28 02:58:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-28 02:58:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-28 02:58:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-28 02:58:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-28 02:58:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-28 02:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-28 02:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-28 02:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-28 02:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-28 02:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-28 02:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-28 02:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-28 02:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-28 02:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-28 02:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-28 02:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-28 02:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-28 02:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-28 02:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-28 02:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-28 02:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-28 02:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-28 02:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-28 02:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-28 02:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-11-28 02:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-28 02:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-28 02:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-28 02:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-28 02:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 02:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-28 02:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:58:32,676 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-28 02:58:33,056 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:58:33,057 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-28 02:58:33,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:33 BoogieIcfgContainer [2020-11-28 02:58:33,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:58:33,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:58:33,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:58:33,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:58:33,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:58:31" (1/3) ... [2020-11-28 02:58:33,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e886b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:58:33, skipping insertion in model container [2020-11-28 02:58:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:32" (2/3) ... [2020-11-28 02:58:33,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e886b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:58:33, skipping insertion in model container [2020-11-28 02:58:33,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:33" (3/3) ... [2020-11-28 02:58:33,070 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-11-28 02:58:33,083 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:58:33,088 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2020-11-28 02:58:33,103 INFO L253 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2020-11-28 02:58:33,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:58:33,125 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-28 02:58:33,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:58:33,125 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:58:33,125 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:58:33,125 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:58:33,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:58:33,126 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:58:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2020-11-28 02:58:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 02:58:33,154 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:33,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:33,155 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618837, now seen corresponding path program 1 times [2020-11-28 02:58:33,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:33,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525457650] [2020-11-28 02:58:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:33,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:33,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525457650] [2020-11-28 02:58:33,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:33,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:33,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712488668] [2020-11-28 02:58:33,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:33,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:33,432 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 4 states. [2020-11-28 02:58:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:33,929 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-11-28 02:58:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:58:33,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 02:58:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:33,941 INFO L225 Difference]: With dead ends: 156 [2020-11-28 02:58:33,941 INFO L226 Difference]: Without dead ends: 147 [2020-11-28 02:58:33,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-28 02:58:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2020-11-28 02:58:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-28 02:58:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2020-11-28 02:58:34,026 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 11 [2020-11-28 02:58:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:34,027 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2020-11-28 02:58:34,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2020-11-28 02:58:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 02:58:34,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:34,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:34,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:58:34,028 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618838, now seen corresponding path program 1 times [2020-11-28 02:58:34,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:34,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153838143] [2020-11-28 02:58:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:34,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:34,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153838143] [2020-11-28 02:58:34,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:34,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:34,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045890014] [2020-11-28 02:58:34,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:34,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:34,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:34,163 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 4 states. [2020-11-28 02:58:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:34,569 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2020-11-28 02:58:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:58:34,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 02:58:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:34,572 INFO L225 Difference]: With dead ends: 142 [2020-11-28 02:58:34,572 INFO L226 Difference]: Without dead ends: 142 [2020-11-28 02:58:34,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-28 02:58:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2020-11-28 02:58:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-28 02:58:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2020-11-28 02:58:34,589 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 11 [2020-11-28 02:58:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:34,589 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2020-11-28 02:58:34,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2020-11-28 02:58:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:58:34,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:34,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:34,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:58:34,592 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -713826160, now seen corresponding path program 1 times [2020-11-28 02:58:34,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:34,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271575384] [2020-11-28 02:58:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:34,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:34,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:34,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271575384] [2020-11-28 02:58:34,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:34,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 02:58:34,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93835481] [2020-11-28 02:58:34,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:58:34,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:34,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:58:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:58:34,739 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand 7 states. [2020-11-28 02:58:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:35,131 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2020-11-28 02:58:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:35,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 02:58:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:35,133 INFO L225 Difference]: With dead ends: 103 [2020-11-28 02:58:35,133 INFO L226 Difference]: Without dead ends: 100 [2020-11-28 02:58:35,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:58:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-28 02:58:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2020-11-28 02:58:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-28 02:58:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-11-28 02:58:35,140 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 14 [2020-11-28 02:58:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:35,140 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-11-28 02:58:35,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:58:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-11-28 02:58:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:58:35,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:35,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:35,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:58:35,142 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1424889429, now seen corresponding path program 1 times [2020-11-28 02:58:35,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:35,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820892167] [2020-11-28 02:58:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:35,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:35,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820892167] [2020-11-28 02:58:35,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:35,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:58:35,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347019109] [2020-11-28 02:58:35,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:35,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:35,245 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 4 states. [2020-11-28 02:58:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:35,477 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-11-28 02:58:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:35,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-28 02:58:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:35,478 INFO L225 Difference]: With dead ends: 97 [2020-11-28 02:58:35,478 INFO L226 Difference]: Without dead ends: 97 [2020-11-28 02:58:35,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:58:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-28 02:58:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2020-11-28 02:58:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-28 02:58:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-11-28 02:58:35,485 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 20 [2020-11-28 02:58:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:35,486 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-11-28 02:58:35,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-11-28 02:58:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 02:58:35,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:35,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:35,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:58:35,487 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601636, now seen corresponding path program 1 times [2020-11-28 02:58:35,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:35,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339477833] [2020-11-28 02:58:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:35,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:35,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:35,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339477833] [2020-11-28 02:58:35,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:35,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-28 02:58:35,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414939567] [2020-11-28 02:58:35,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:35,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:35,678 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 9 states. [2020-11-28 02:58:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:36,138 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-11-28 02:58:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:36,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-11-28 02:58:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:36,139 INFO L225 Difference]: With dead ends: 96 [2020-11-28 02:58:36,140 INFO L226 Difference]: Without dead ends: 96 [2020-11-28 02:58:36,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-28 02:58:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-11-28 02:58:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-28 02:58:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2020-11-28 02:58:36,145 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2020-11-28 02:58:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:36,145 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2020-11-28 02:58:36,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2020-11-28 02:58:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 02:58:36,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:36,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:36,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:58:36,147 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601637, now seen corresponding path program 1 times [2020-11-28 02:58:36,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:36,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778909005] [2020-11-28 02:58:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:36,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:36,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:36,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778909005] [2020-11-28 02:58:36,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85073296] [2020-11-28 02:58:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:36,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 02:58:36,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:36,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:36,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-11-28 02:58:36,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803423380] [2020-11-28 02:58:36,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:36,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:36,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:36,663 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 9 states. [2020-11-28 02:58:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:37,072 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2020-11-28 02:58:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 02:58:37,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-11-28 02:58:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:37,073 INFO L225 Difference]: With dead ends: 108 [2020-11-28 02:58:37,073 INFO L226 Difference]: Without dead ends: 105 [2020-11-28 02:58:37,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-28 02:58:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-28 02:58:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2020-11-28 02:58:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-28 02:58:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2020-11-28 02:58:37,077 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 26 [2020-11-28 02:58:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:37,078 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2020-11-28 02:58:37,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2020-11-28 02:58:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-28 02:58:37,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:37,079 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:37,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-28 02:58:37,280 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -872929728, now seen corresponding path program 1 times [2020-11-28 02:58:37,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:37,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050602381] [2020-11-28 02:58:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:37,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:37,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050602381] [2020-11-28 02:58:37,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142706405] [2020-11-28 02:58:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:37,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 02:58:37,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:37,736 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-28 02:58:37,736 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:37,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:37,741 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:37,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-28 02:58:37,817 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:37,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-28 02:58:37,819 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:37,845 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-28 02:58:37,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 02:58:37,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-11-28 02:58:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:37,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:37,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-11-28 02:58:37,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116811534] [2020-11-28 02:58:37,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:37,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:37,877 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 9 states. [2020-11-28 02:58:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:38,243 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2020-11-28 02:58:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:38,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-11-28 02:58:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:38,245 INFO L225 Difference]: With dead ends: 91 [2020-11-28 02:58:38,245 INFO L226 Difference]: Without dead ends: 91 [2020-11-28 02:58:38,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-28 02:58:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-28 02:58:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-11-28 02:58:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-28 02:58:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2020-11-28 02:58:38,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 32 [2020-11-28 02:58:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:38,260 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2020-11-28 02:58:38,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2020-11-28 02:58:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-28 02:58:38,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:38,263 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:38,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:38,480 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash 603691449, now seen corresponding path program 2 times [2020-11-28 02:58:38,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:38,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842527722] [2020-11-28 02:58:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:38,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:38,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:38,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842527722] [2020-11-28 02:58:38,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850245689] [2020-11-28 02:58:38,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:38,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:58:38,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:58:38,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 02:58:38,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:38,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:38,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-11-28 02:58:38,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617309818] [2020-11-28 02:58:38,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 02:58:38,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 02:58:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:58:38,912 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 11 states. [2020-11-28 02:58:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:39,512 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2020-11-28 02:58:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 02:58:39,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-11-28 02:58:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:39,514 INFO L225 Difference]: With dead ends: 119 [2020-11-28 02:58:39,514 INFO L226 Difference]: Without dead ends: 116 [2020-11-28 02:58:39,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-28 02:58:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-28 02:58:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2020-11-28 02:58:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-28 02:58:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2020-11-28 02:58:39,519 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 38 [2020-11-28 02:58:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:39,520 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2020-11-28 02:58:39,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 02:58:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2020-11-28 02:58:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-28 02:58:39,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:39,521 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:39,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:39,740 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -222202587, now seen corresponding path program 1 times [2020-11-28 02:58:39,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:39,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431675574] [2020-11-28 02:58:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:39,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:39,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:39,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431675574] [2020-11-28 02:58:39,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358923694] [2020-11-28 02:58:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:40,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 02:58:40,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:40,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:40,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-28 02:58:40,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982253046] [2020-11-28 02:58:40,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 02:58:40,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 02:58:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:58:40,271 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 11 states. [2020-11-28 02:58:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:40,579 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-11-28 02:58:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 02:58:40,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-11-28 02:58:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:40,581 INFO L225 Difference]: With dead ends: 132 [2020-11-28 02:58:40,581 INFO L226 Difference]: Without dead ends: 129 [2020-11-28 02:58:40,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-11-28 02:58:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-28 02:58:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2020-11-28 02:58:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-28 02:58:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2020-11-28 02:58:40,586 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 52 [2020-11-28 02:58:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:40,586 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2020-11-28 02:58:40,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 02:58:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2020-11-28 02:58:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-28 02:58:40,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:40,588 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:40,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:40,800 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -710767347, now seen corresponding path program 2 times [2020-11-28 02:58:40,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:40,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698367884] [2020-11-28 02:58:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:40,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:40,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:41,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698367884] [2020-11-28 02:58:41,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59990486] [2020-11-28 02:58:41,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:41,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:58:41,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:58:41,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 02:58:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:41,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:41,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2020-11-28 02:58:41,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865683537] [2020-11-28 02:58:41,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-28 02:58:41,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 02:58:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:41,474 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 12 states. [2020-11-28 02:58:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:41,901 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2020-11-28 02:58:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 02:58:41,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-11-28 02:58:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:41,903 INFO L225 Difference]: With dead ends: 145 [2020-11-28 02:58:41,903 INFO L226 Difference]: Without dead ends: 142 [2020-11-28 02:58:41,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-28 02:58:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-28 02:58:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2020-11-28 02:58:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-28 02:58:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2020-11-28 02:58:41,908 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 65 [2020-11-28 02:58:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:41,909 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2020-11-28 02:58:41,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-28 02:58:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2020-11-28 02:58:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-28 02:58:41,910 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:41,911 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:42,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-28 02:58:42,132 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 108891685, now seen corresponding path program 3 times [2020-11-28 02:58:42,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:42,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200656923] [2020-11-28 02:58:42,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:42,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:42,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-28 02:58:42,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200656923] [2020-11-28 02:58:42,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:42,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-28 02:58:42,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242549748] [2020-11-28 02:58:42,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:42,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:42,415 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 9 states. [2020-11-28 02:58:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:42,965 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2020-11-28 02:58:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:42,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-28 02:58:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:42,967 INFO L225 Difference]: With dead ends: 164 [2020-11-28 02:58:42,967 INFO L226 Difference]: Without dead ends: 164 [2020-11-28 02:58:42,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-28 02:58:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2020-11-28 02:58:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-28 02:58:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2020-11-28 02:58:42,973 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 78 [2020-11-28 02:58:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:42,973 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2020-11-28 02:58:42,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-11-28 02:58:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-28 02:58:42,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:42,975 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:42,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:58:42,975 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1392676980, now seen corresponding path program 1 times [2020-11-28 02:58:42,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:42,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243287155] [2020-11-28 02:58:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:43,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:43,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-28 02:58:43,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243287155] [2020-11-28 02:58:43,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:43,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 02:58:43,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278691937] [2020-11-28 02:58:43,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:43,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:43,296 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 9 states. [2020-11-28 02:58:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:43,745 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2020-11-28 02:58:43,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:43,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-11-28 02:58:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:43,747 INFO L225 Difference]: With dead ends: 161 [2020-11-28 02:58:43,747 INFO L226 Difference]: Without dead ends: 161 [2020-11-28 02:58:43,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-28 02:58:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-28 02:58:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-28 02:58:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2020-11-28 02:58:43,756 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 82 [2020-11-28 02:58:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:43,756 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2020-11-28 02:58:43,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2020-11-28 02:58:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-28 02:58:43,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:43,763 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:43,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:58:43,764 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1468486517, now seen corresponding path program 1 times [2020-11-28 02:58:43,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:43,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261590861] [2020-11-28 02:58:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:43,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:43,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-28 02:58:44,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261590861] [2020-11-28 02:58:44,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933731350] [2020-11-28 02:58:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:44,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-28 02:58:44,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:44,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-28 02:58:44,533 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-28 02:58:44,598 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,598 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-28 02:58:44,599 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,602 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-11-28 02:58:44,609 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 02:58:44,610 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,616 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,616 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-11-28 02:58:44,644 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-11-28 02:58:44,664 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-11-28 02:58:44,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2020-11-28 02:58:44,665 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,683 INFO L625 ElimStorePlain]: treesize reduction 13, result has 56.7 percent of original size [2020-11-28 02:58:44,684 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,692 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,692 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2020-11-28 02:58:44,761 INFO L350 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2020-11-28 02:58:44,762 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2020-11-28 02:58:44,763 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,776 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-11-28 02:58:44,804 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-11-28 02:58:44,804 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:44,805 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,814 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-11-28 02:58:44,853 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-11-28 02:58:44,853 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:44,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,861 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,861 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-11-28 02:58:44,878 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-28 02:58:44,879 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:44,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:44,886 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:44,886 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2020-11-28 02:58:45,048 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-28 02:58:45,048 INFO L384 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 24 treesize of output 10 [2020-11-28 02:58:45,055 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:45,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:45,058 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:45,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2020-11-28 02:58:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-28 02:58:45,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:45,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2020-11-28 02:58:45,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483848702] [2020-11-28 02:58:45,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-28 02:58:45,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-28 02:58:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2020-11-28 02:58:45,077 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 22 states. [2020-11-28 02:58:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:46,092 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2020-11-28 02:58:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-28 02:58:46,092 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2020-11-28 02:58:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:46,094 INFO L225 Difference]: With dead ends: 161 [2020-11-28 02:58:46,094 INFO L226 Difference]: Without dead ends: 161 [2020-11-28 02:58:46,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2020-11-28 02:58:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-28 02:58:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-28 02:58:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-28 02:58:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2020-11-28 02:58:46,105 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 88 [2020-11-28 02:58:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:46,107 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2020-11-28 02:58:46,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-28 02:58:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2020-11-28 02:58:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-28 02:58:46,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:46,110 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:46,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:46,324 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1744307152, now seen corresponding path program 1 times [2020-11-28 02:58:46,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:46,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021130911] [2020-11-28 02:58:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:46,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:46,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-28 02:58:46,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021130911] [2020-11-28 02:58:46,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392669713] [2020-11-28 02:58:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:47,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 49 conjunts are in the unsatisfiable core [2020-11-28 02:58:47,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:47,163 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-28 02:58:47,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,168 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,168 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-28 02:58:47,216 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-28 02:58:47,217 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-28 02:58:47,258 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-28 02:58:47,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,266 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-11-28 02:58:47,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:47,310 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-11-28 02:58:47,311 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2020-11-28 02:58:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:47,343 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-28 02:58:47,344 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,354 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,355 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-11-28 02:58:47,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:47,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-28 02:58:47,365 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-11-28 02:58:47,396 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-28 02:58:47,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,416 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,416 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2020-11-28 02:58:47,567 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-28 02:58:47,567 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:47,569 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:47,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-11-28 02:58:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-28 02:58:47,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:47,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2020-11-28 02:58:47,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052873131] [2020-11-28 02:58:47,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-28 02:58:47,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-28 02:58:47,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-11-28 02:58:47,586 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 24 states. [2020-11-28 02:58:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:48,691 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2020-11-28 02:58:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-28 02:58:48,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2020-11-28 02:58:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:48,692 INFO L225 Difference]: With dead ends: 161 [2020-11-28 02:58:48,692 INFO L226 Difference]: Without dead ends: 161 [2020-11-28 02:58:48,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2020-11-28 02:58:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-28 02:58:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-28 02:58:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-28 02:58:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-11-28 02:58:48,698 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 90 [2020-11-28 02:58:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:48,699 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-11-28 02:58:48,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-28 02:58:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-11-28 02:58:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-28 02:58:48,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:48,702 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:48,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-28 02:58:48,928 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash -724764429, now seen corresponding path program 1 times [2020-11-28 02:58:48,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:48,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753228034] [2020-11-28 02:58:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:49,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-28 02:58:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:49,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-28 02:58:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-28 02:58:49,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753228034] [2020-11-28 02:58:49,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530902653] [2020-11-28 02:58:49,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:49,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-28 02:58:49,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:49,620 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-28 02:58:49,620 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,644 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,644 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-28 02:58:49,691 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,692 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-11-28 02:58:49,692 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,698 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,699 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-28 02:58:49,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-28 02:58:49,732 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-11-28 02:58:49,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,809 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-28 02:58:49,810 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,823 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,823 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-11-28 02:58:49,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-28 02:58:49,873 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,895 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,895 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2020-11-28 02:58:49,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,908 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:49,909 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-11-28 02:58:49,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,935 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:49,936 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-11-28 02:58:49,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:49,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-28 02:58:49,958 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:49,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:49,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2020-11-28 02:58:50,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:50,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-28 02:58:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-28 02:58:50,241 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:50,242 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2020-11-28 02:58:50,243 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:50,262 INFO L625 ElimStorePlain]: treesize reduction 3, result has 81.3 percent of original size [2020-11-28 02:58:50,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:50,265 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2020-11-28 02:58:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-28 02:58:50,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:50,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2020-11-28 02:58:50,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211615167] [2020-11-28 02:58:50,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-28 02:58:50,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-28 02:58:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2020-11-28 02:58:50,287 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 24 states. [2020-11-28 02:58:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:53,188 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2020-11-28 02:58:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-28 02:58:53,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-11-28 02:58:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:53,191 INFO L225 Difference]: With dead ends: 161 [2020-11-28 02:58:53,191 INFO L226 Difference]: Without dead ends: 161 [2020-11-28 02:58:53,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2020-11-28 02:58:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-28 02:58:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-11-28 02:58:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-28 02:58:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2020-11-28 02:58:53,197 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 91 [2020-11-28 02:58:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:53,197 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2020-11-28 02:58:53,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-28 02:58:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2020-11-28 02:58:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-28 02:58:53,198 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:53,198 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:53,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-28 02:58:53,420 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-11-28 02:58:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1598496843, now seen corresponding path program 1 times [2020-11-28 02:58:53,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:53,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193168840] [2020-11-28 02:58:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:53,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:53,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:53,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:53,625 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:58:53,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 02:58:53,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:58:53 BoogieIcfgContainer [2020-11-28 02:58:53,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:58:53,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:58:53,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:58:53,714 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:58:53,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:33" (3/4) ... [2020-11-28 02:58:53,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:58:53,797 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ceff074b-bca0-430c-856a-5f975587a0a2/bin/uautomizer/witness.graphml [2020-11-28 02:58:53,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:58:53,798 INFO L168 Benchmark]: Toolchain (without parser) took 22336.70 ms. Allocated memory was 98.6 MB in the beginning and 302.0 MB in the end (delta: 203.4 MB). Free memory was 69.7 MB in the beginning and 122.9 MB in the end (delta: -53.3 MB). Peak memory consumption was 149.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,798 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 98.6 MB. Free memory was 57.2 MB in the beginning and 57.1 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:58:53,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.36 ms. Allocated memory is still 98.6 MB. Free memory was 69.4 MB in the beginning and 62.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,799 INFO L168 Benchmark]: Boogie Preprocessor took 104.02 ms. Allocated memory is still 98.6 MB. Free memory was 62.3 MB in the beginning and 59.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,800 INFO L168 Benchmark]: RCFGBuilder took 913.55 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 59.5 MB in the beginning and 92.2 MB in the end (delta: -32.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,800 INFO L168 Benchmark]: TraceAbstraction took 20651.48 ms. Allocated memory was 119.5 MB in the beginning and 302.0 MB in the end (delta: 182.5 MB). Free memory was 92.2 MB in the beginning and 128.2 MB in the end (delta: -35.9 MB). Peak memory consumption was 145.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,800 INFO L168 Benchmark]: Witness Printer took 84.10 ms. Allocated memory is still 302.0 MB. Free memory was 128.2 MB in the beginning and 122.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:53,802 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 98.6 MB. Free memory was 57.2 MB in the beginning and 57.1 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.36 ms. Allocated memory is still 98.6 MB. Free memory was 69.4 MB in the beginning and 62.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 104.02 ms. Allocated memory is still 98.6 MB. Free memory was 62.3 MB in the beginning and 59.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 913.55 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 59.5 MB in the beginning and 92.2 MB in the end (delta: -32.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20651.48 ms. Allocated memory was 119.5 MB in the beginning and 302.0 MB in the end (delta: 182.5 MB). Free memory was 92.2 MB in the beginning and 128.2 MB in the end (delta: -35.9 MB). Peak memory consumption was 145.3 MB. Max. memory is 16.1 GB. * Witness Printer took 84.10 ms. Allocated memory is still 302.0 MB. Free memory was 128.2 MB in the beginning and 122.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 111 locations, 35 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.5s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1037 SDtfs, 1412 SDslu, 5091 SDs, 0 SdLazy, 5384 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 512 SyntacticMatches, 12 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 172 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1183 ConstructedInterpolants, 11 QuantifiedInterpolants, 381188 SizeOfPredicates, 79 NumberOfNonLiveVariables, 2738 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 965/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...