./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be --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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe .................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be --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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:26:04,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:26:04,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:26:04,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:26:04,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:26:04,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:26:04,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:26:04,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:26:04,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:26:04,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:26:04,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:26:04,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:26:04,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:26:04,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:26:04,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:26:04,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:26:04,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:26:04,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:26:04,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:26:04,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:26:04,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:26:04,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:26:04,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:26:04,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:26:04,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:26:04,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:26:04,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:26:04,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:26:04,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:26:04,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:26:04,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:26:05,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:26:05,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:26:05,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:26:05,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:26:05,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:26:05,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:26:05,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:26:05,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:26:05,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:26:05,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:26:05,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-21 19:26:05,059 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:26:05,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:26:05,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:26:05,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:26:05,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:26:05,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:26:05,074 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:26:05,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:26:05,074 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:26:05,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:26:05,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:26:05,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:26:05,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:26:05,076 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:26:05,076 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:26:05,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:26:05,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:26:05,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:26:05,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:26:05,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:26:05,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:26:05,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:26:05,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:26:05,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:26:05,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:26:05,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:26:05,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:26:05,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:26:05,080 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_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/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_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2021-10-21 19:26:05,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:26:05,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:26:05,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:26:05,360 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:26:05,361 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:26:05,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2021-10-21 19:26:05,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/1ebaac24d/1c31a86516d344ddb8fb3059c2583634/FLAG9148bce72 [2021-10-21 19:26:05,966 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:26:05,966 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c [2021-10-21 19:26:05,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/1ebaac24d/1c31a86516d344ddb8fb3059c2583634/FLAG9148bce72 [2021-10-21 19:26:06,325 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/1ebaac24d/1c31a86516d344ddb8fb3059c2583634 [2021-10-21 19:26:06,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:26:06,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:26:06,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:06,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:26:06,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:26:06,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:06" (1/1) ... [2021-10-21 19:26:06,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363475b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:06, skipping insertion in model container [2021-10-21 19:26:06,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:06" (1/1) ... [2021-10-21 19:26:06,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:26:06,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:26:06,494 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2021-10-21 19:26:06,513 WARN L1507 CHandler]: Possible shadowing of function min [2021-10-21 19:26:06,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:06,542 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-10-21 19:26:06,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@179db450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:06, skipping insertion in model container [2021-10-21 19:26:06,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:06,544 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-10-21 19:26:06,546 INFO L168 Benchmark]: Toolchain (without parser) took 215.85 ms. Allocated memory is still 90.2 MB. Free memory was 60.2 MB in the beginning and 50.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:26:06,547 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 90.2 MB. Free memory is still 59.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:26:06,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.23 ms. Allocated memory is still 90.2 MB. Free memory was 60.0 MB in the beginning and 50.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:26:06,550 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.25 ms. Allocated memory is still 90.2 MB. Free memory is still 59.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 213.23 ms. Allocated memory is still 90.2 MB. Free memory was 60.0 MB in the beginning and 50.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 28]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:26:08,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:26:08,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:26:08,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:26:08,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:26:08,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:26:08,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:26:08,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:26:08,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:26:08,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:26:08,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:26:08,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:26:08,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:26:08,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:26:08,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:26:08,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:26:08,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:26:08,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:26:08,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:26:08,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:26:08,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:26:08,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:26:08,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:26:08,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:26:08,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:26:08,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:26:08,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:26:08,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:26:08,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:26:08,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:26:08,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:26:09,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:26:09,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:26:09,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:26:09,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:26:09,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:26:09,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:26:09,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:26:09,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:26:09,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:26:09,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:26:09,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-10-21 19:26:09,068 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:26:09,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:26:09,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:26:09,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:26:09,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:26:09,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:26:09,072 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:26:09,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:26:09,073 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:26:09,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:26:09,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:26:09,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:26:09,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:26:09,075 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:26:09,075 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:26:09,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:26:09,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:26:09,076 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-21 19:26:09,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-21 19:26:09,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:26:09,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:26:09,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:26:09,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:26:09,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:26:09,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:26:09,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:26:09,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:26:09,079 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-21 19:26:09,079 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-21 19:26:09,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:26:09,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-21 19:26:09,080 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/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_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2021-10-21 19:26:09,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:26:09,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:26:09,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:26:09,523 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:26:09,524 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:26:09,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2021-10-21 19:26:09,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/c8750d940/6f85073da78b4acfaf226877749f75c8/FLAG5de826c3e [2021-10-21 19:26:10,191 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:26:10,193 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c [2021-10-21 19:26:10,200 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/c8750d940/6f85073da78b4acfaf226877749f75c8/FLAG5de826c3e [2021-10-21 19:26:10,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/data/c8750d940/6f85073da78b4acfaf226877749f75c8 [2021-10-21 19:26:10,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:26:10,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:26:10,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:10,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:26:10,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:26:10,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:10" (1/1) ... [2021-10-21 19:26:10,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aee9071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:10, skipping insertion in model container [2021-10-21 19:26:10,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:10" (1/1) ... [2021-10-21 19:26:10,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:26:10,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:26:10,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2021-10-21 19:26:10,780 WARN L1507 CHandler]: Possible shadowing of function min [2021-10-21 19:26:10,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:10,853 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-10-21 19:26:10,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:26:10,881 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2021-10-21 19:26:10,901 WARN L1507 CHandler]: Possible shadowing of function min [2021-10-21 19:26:10,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:10,940 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:26:10,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2021-10-21 19:26:10,988 WARN L1507 CHandler]: Possible shadowing of function min [2021-10-21 19:26:11,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:11,032 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:26:11,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11 WrapperNode [2021-10-21 19:26:11,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:11,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:26:11,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:26:11,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:26:11,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:26:11,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:26:11,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:26:11,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:26:11,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (1/1) ... [2021-10-21 19:26:11,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:26:11,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:11,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:11,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:26:11,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:26:11,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:26:11,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2021-10-21 19:26:11,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:26:11,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-10-21 19:26:11,246 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-10-21 19:26:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-10-21 19:26:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-10-21 19:26:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-10-21 19:26:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-10-21 19:26:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2021-10-21 19:26:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:26:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-10-21 19:26:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-21 19:26:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-21 19:26:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-21 19:26:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:26:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-10-21 19:26:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2021-10-21 19:26:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:26:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:26:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:26:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:26:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-10-21 19:26:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-10-21 19:26:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 19:26:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-21 19:26:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 19:26:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-10-21 19:26:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-21 19:26:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 19:26:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-10-21 19:26:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:26:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-10-21 19:26:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-10-21 19:26:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure task [2021-10-21 19:26:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-10-21 19:26:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:26:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:26:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-21 19:26:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:26:11,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-21 19:26:11,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-10-21 19:26:12,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:26:12,252 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-10-21 19:26:12,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:12 BoogieIcfgContainer [2021-10-21 19:26:12,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:26:12,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:26:12,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:26:12,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:26:12,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:26:10" (1/3) ... [2021-10-21 19:26:12,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f0fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:26:12, skipping insertion in model container [2021-10-21 19:26:12,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:11" (2/3) ... [2021-10-21 19:26:12,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f0fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:26:12, skipping insertion in model container [2021-10-21 19:26:12,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:12" (3/3) ... [2021-10-21 19:26:12,266 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2021-10-21 19:26:12,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:26:12,273 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-10-21 19:26:12,335 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:26:12,344 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:26:12,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-10-21 19:26:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 168 states have internal predecessors, (183), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-10-21 19:26:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-21 19:26:12,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:12,389 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:12,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -682991689, now seen corresponding path program 1 times [2021-10-21 19:26:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:12,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60215593] [2021-10-21 19:26:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:12,412 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:12,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:12,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-21 19:26:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:12,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:26:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:12,666 INFO L388 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 [2021-10-21 19:26:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:12,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:12,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:12,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60215593] [2021-10-21 19:26:12,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60215593] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:12,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:12,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-21 19:26:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847564008] [2021-10-21 19:26:12,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:26:12,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:12,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:26:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:26:12,753 INFO L87 Difference]: Start difference. First operand has 205 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 168 states have internal predecessors, (183), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:26:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:13,078 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2021-10-21 19:26:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:26:13,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2021-10-21 19:26:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:13,097 INFO L225 Difference]: With dead ends: 206 [2021-10-21 19:26:13,098 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:26:13,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:26:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:26:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2021-10-21 19:26:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 102 states have (on average 1.696078431372549) internal successors, (173), 164 states have internal predecessors, (173), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-10-21 19:26:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-10-21 19:26:13,162 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 8 [2021-10-21 19:26:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:13,163 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-10-21 19:26:13,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:26:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-10-21 19:26:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-21 19:26:13,164 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:13,165 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:13,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:13,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:13,376 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash -682991688, now seen corresponding path program 1 times [2021-10-21 19:26:13,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:13,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782699275] [2021-10-21 19:26:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:13,378 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:13,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:13,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:13,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-21 19:26:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:13,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-21 19:26:13,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:13,500 INFO L388 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 [2021-10-21 19:26:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:13,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:13,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:13,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782699275] [2021-10-21 19:26:13,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782699275] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:13,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:13,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-21 19:26:13,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219638050] [2021-10-21 19:26:13,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:26:13,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:26:13,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:26:13,591 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:26:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:14,031 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-10-21 19:26:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:26:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2021-10-21 19:26:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:14,036 INFO L225 Difference]: With dead ends: 199 [2021-10-21 19:26:14,036 INFO L226 Difference]: Without dead ends: 199 [2021-10-21 19:26:14,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:26:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-21 19:26:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-10-21 19:26:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 163 states have internal predecessors, (172), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-10-21 19:26:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2021-10-21 19:26:14,067 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 8 [2021-10-21 19:26:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:14,067 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2021-10-21 19:26:14,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:26:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2021-10-21 19:26:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:26:14,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:14,069 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:14,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:14,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:14,279 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting minErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1324839054, now seen corresponding path program 1 times [2021-10-21 19:26:14,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:14,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859047834] [2021-10-21 19:26:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:14,281 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:14,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:14,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-21 19:26:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:14,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-21 19:26:14,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:14,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:14,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:14,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859047834] [2021-10-21 19:26:14,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859047834] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:14,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:14,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-10-21 19:26:14,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573731282] [2021-10-21 19:26:14,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:26:14,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:26:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:26:14,684 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-21 19:26:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:14,867 INFO L93 Difference]: Finished difference Result 264 states and 303 transitions. [2021-10-21 19:26:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:26:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-10-21 19:26:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:14,871 INFO L225 Difference]: With dead ends: 264 [2021-10-21 19:26:14,871 INFO L226 Difference]: Without dead ends: 264 [2021-10-21 19:26:14,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.6ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:26:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-21 19:26:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2021-10-21 19:26:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 195 states have internal predecessors, (218), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-10-21 19:26:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2021-10-21 19:26:14,894 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 15 [2021-10-21 19:26:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:14,895 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2021-10-21 19:26:14,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-21 19:26:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2021-10-21 19:26:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-21 19:26:14,896 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:14,896 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:14,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:15,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:15,107 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1881147096, now seen corresponding path program 1 times [2021-10-21 19:26:15,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:15,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597612624] [2021-10-21 19:26:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:15,109 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:15,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:15,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-21 19:26:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:15,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:26:15,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:15,228 INFO L388 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 [2021-10-21 19:26:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:15,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:15,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:15,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597612624] [2021-10-21 19:26:15,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597612624] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:15,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:15,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-21 19:26:15,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078207375] [2021-10-21 19:26:15,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:26:15,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:15,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:26:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:26:15,391 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-21 19:26:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:16,106 INFO L93 Difference]: Finished difference Result 245 states and 296 transitions. [2021-10-21 19:26:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:26:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 14 [2021-10-21 19:26:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:16,110 INFO L225 Difference]: With dead ends: 245 [2021-10-21 19:26:16,111 INFO L226 Difference]: Without dead ends: 245 [2021-10-21 19:26:16,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:26:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-21 19:26:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-21 19:26:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 193 states have internal predecessors, (216), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-10-21 19:26:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 296 transitions. [2021-10-21 19:26:16,147 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 296 transitions. Word has length 14 [2021-10-21 19:26:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:16,153 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 296 transitions. [2021-10-21 19:26:16,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-21 19:26:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 296 transitions. [2021-10-21 19:26:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-21 19:26:16,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:16,156 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:16,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:16,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:16,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1881147095, now seen corresponding path program 1 times [2021-10-21 19:26:16,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:16,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312261578] [2021-10-21 19:26:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:16,363 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:16,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:16,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:16,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-21 19:26:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:16,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 19:26:16,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:16,512 INFO L388 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 [2021-10-21 19:26:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:16,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:16,867 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:16,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312261578] [2021-10-21 19:26:16,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312261578] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:16,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:16,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-21 19:26:16,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107496753] [2021-10-21 19:26:16,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:26:16,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:26:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:26:16,870 INFO L87 Difference]: Start difference. First operand 245 states and 296 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-21 19:26:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:18,261 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2021-10-21 19:26:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:26:18,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 14 [2021-10-21 19:26:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:18,269 INFO L225 Difference]: With dead ends: 257 [2021-10-21 19:26:18,269 INFO L226 Difference]: Without dead ends: 257 [2021-10-21 19:26:18,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 72.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:26:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-21 19:26:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2021-10-21 19:26:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 195 states have internal predecessors, (219), 40 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (43), 40 states have call predecessors, (43), 39 states have call successors, (43) [2021-10-21 19:26:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 302 transitions. [2021-10-21 19:26:18,284 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 302 transitions. Word has length 14 [2021-10-21 19:26:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:18,285 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 302 transitions. [2021-10-21 19:26:18,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-21 19:26:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 302 transitions. [2021-10-21 19:26:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 19:26:18,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:18,286 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:18,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:18,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:18,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sizeErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1095317470, now seen corresponding path program 1 times [2021-10-21 19:26:18,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:18,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637030592] [2021-10-21 19:26:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:18,495 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:18,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:18,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:18,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-21 19:26:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:18,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-21 19:26:18,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:18,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:18,927 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:26:18,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637030592] [2021-10-21 19:26:18,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637030592] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:18,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:18,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-10-21 19:26:18,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136712471] [2021-10-21 19:26:18,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:26:18,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:26:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:26:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:26:18,930 INFO L87 Difference]: Start difference. First operand 249 states and 302 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-21 19:26:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:19,100 INFO L93 Difference]: Finished difference Result 270 states and 311 transitions. [2021-10-21 19:26:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:26:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2021-10-21 19:26:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:26:19,103 INFO L225 Difference]: With dead ends: 270 [2021-10-21 19:26:19,103 INFO L226 Difference]: Without dead ends: 270 [2021-10-21 19:26:19,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 92.5ms TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:26:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-21 19:26:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2021-10-21 19:26:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 139 states have (on average 1.5971223021582734) internal successors, (222), 198 states have internal predecessors, (222), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (43), 40 states have call predecessors, (43), 39 states have call successors, (43) [2021-10-21 19:26:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2021-10-21 19:26:19,117 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 21 [2021-10-21 19:26:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:26:19,117 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2021-10-21 19:26:19,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-21 19:26:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2021-10-21 19:26:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-21 19:26:19,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:26:19,119 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:19,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:19,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:26:19,330 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting nondet_treeErr3REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:26:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1209368675, now seen corresponding path program 1 times [2021-10-21 19:26:19,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:26:19,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87771317] [2021-10-21 19:26:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:19,331 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:26:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:26:19,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:26:19,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-21 19:26:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:19,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:26:19,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:19,578 INFO L388 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 [2021-10-21 19:26:19,584 INFO L388 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 [2021-10-21 19:26:19,887 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-21 19:26:19,887 INFO L388 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 26 treesize of output 28 [2021-10-21 19:26:19,897 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-21 19:26:19,897 INFO L388 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 25 treesize of output 25 [2021-10-21 19:26:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-21 19:26:19,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:26:26,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_6 (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (and (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse0) (bvule .cse0 (select |c_#length| v_nondet_tree_~n~0.base_BEFORE_CALL_6)))) (exists ((v_nondet_tree_~n~0.base_19 (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| v_nondet_tree_~n~0.base_19 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_6))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_19)))))))))) is different from false [2021-10-21 19:26:28,699 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:26:28,700 INFO L388 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 124 treesize of output 128 [2021-10-21 19:26:28,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:26:28,728 INFO L388 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 128 treesize of output 132 [2021-10-21 19:26:40,248 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:26:40,248 INFO L388 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 118 treesize of output 122 [2021-10-21 19:26:40,271 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:26:40,271 INFO L388 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 122 treesize of output 126 [2021-10-21 19:26:59,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_nondet_tree_~n~0.base_20 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_6 (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (and (bvule .cse0 (select (store |c_#length| v_nondet_tree_~n~0.base_20 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_6)) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse0))) (not (= (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_20)))))) (_ bv0 1))) (exists ((v_nondet_tree_~n~0.base_19 (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| v_nondet_tree_~n~0.base_19 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_6))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_19)))))))))) is different from false [2021-10-21 19:27:01,255 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_nondet_tree_~n~0.base_20 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_6 (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (and (bvule .cse0 (select (store |c_#length| v_nondet_tree_~n~0.base_20 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_6)) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse0))) (not (= (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_20)))))) (_ bv0 1))) (exists ((v_nondet_tree_~n~0.base_19 (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv8 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4))) (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_4) .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| v_nondet_tree_~n~0.base_19 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_6))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_19)))))))))) is different from true [2021-10-21 19:27:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 4 times theorem prover too weak. 3 trivial. 4 not checked. [2021-10-21 19:27:01,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:27:01,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87771317] [2021-10-21 19:27:01,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87771317] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:27:01,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:27:01,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-10-21 19:27:01,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369561110] [2021-10-21 19:27:01,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:27:01,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:27:01,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:27:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=5, NotChecked=30, Total=110 [2021-10-21 19:27:01,406 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-10-21 19:27:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:15,407 INFO L93 Difference]: Finished difference Result 272 states and 339 transitions. [2021-10-21 19:27:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:27:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 28 [2021-10-21 19:27:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:15,411 INFO L225 Difference]: With dead ends: 272 [2021-10-21 19:27:15,411 INFO L226 Difference]: Without dead ends: 272 [2021-10-21 19:27:15,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 18812.1ms TimeCoverageRelationStatistics Valid=44, Invalid=90, Unknown=6, NotChecked=42, Total=182 [2021-10-21 19:27:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-21 19:27:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2021-10-21 19:27:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 144 states have (on average 1.5763888888888888) internal successors, (227), 203 states have internal predecessors, (227), 41 states have call successors, (41), 14 states have call predecessors, (41), 15 states have return successors, (50), 42 states have call predecessors, (50), 40 states have call successors, (50) [2021-10-21 19:27:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2021-10-21 19:27:15,428 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 28 [2021-10-21 19:27:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:15,429 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2021-10-21 19:27:15,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-10-21 19:27:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2021-10-21 19:27:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:27:15,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:15,431 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:15,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:27:15,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:27:15,644 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting minErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:27:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1599105218, now seen corresponding path program 1 times [2021-10-21 19:27:15,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:27:15,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967235284] [2021-10-21 19:27:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:15,645 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:27:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:27:15,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:27:15,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-21 19:27:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:15,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:27:15,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:27:15,880 INFO L388 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 [2021-10-21 19:27:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-21 19:27:16,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:27:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-21 19:27:16,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:27:16,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967235284] [2021-10-21 19:27:16,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967235284] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:27:16,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:27:16,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-10-21 19:27:16,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298834098] [2021-10-21 19:27:16,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:27:16,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:27:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:27:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:16,695 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:27:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:19,951 INFO L93 Difference]: Finished difference Result 279 states and 342 transitions. [2021-10-21 19:27:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:27:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2021-10-21 19:27:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:19,955 INFO L225 Difference]: With dead ends: 279 [2021-10-21 19:27:19,955 INFO L226 Difference]: Without dead ends: 279 [2021-10-21 19:27:19,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 574.3ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:27:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-21 19:27:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2021-10-21 19:27:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 212 states have internal predecessors, (242), 43 states have call successors, (43), 15 states have call predecessors, (43), 16 states have return successors, (52), 44 states have call predecessors, (52), 42 states have call successors, (52) [2021-10-21 19:27:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 337 transitions. [2021-10-21 19:27:19,977 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 337 transitions. Word has length 29 [2021-10-21 19:27:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:19,981 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 337 transitions. [2021-10-21 19:27:19,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:27:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 337 transitions. [2021-10-21 19:27:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:27:19,989 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:19,989 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:20,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-21 19:27:20,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:27:20,203 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting minErr1REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:27:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:20,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1599105217, now seen corresponding path program 1 times [2021-10-21 19:27:20,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:27:20,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55134840] [2021-10-21 19:27:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:20,205 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:27:20,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:27:20,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:27:20,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-21 19:27:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:20,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-21 19:27:20,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:27:20,493 INFO L388 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 [2021-10-21 19:27:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-21 19:27:20,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:27:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-21 19:27:22,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:27:22,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55134840] [2021-10-21 19:27:22,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55134840] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:27:22,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:27:22,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-10-21 19:27:22,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701521270] [2021-10-21 19:27:22,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-21 19:27:22,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:27:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-21 19:27:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:27:22,739 INFO L87 Difference]: Start difference. First operand 272 states and 337 transitions. Second operand has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-10-21 19:27:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:31,012 INFO L93 Difference]: Finished difference Result 298 states and 376 transitions. [2021-10-21 19:27:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:27:31,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29 [2021-10-21 19:27:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:31,016 INFO L225 Difference]: With dead ends: 298 [2021-10-21 19:27:31,017 INFO L226 Difference]: Without dead ends: 298 [2021-10-21 19:27:31,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1835.2ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:27:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-21 19:27:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 289. [2021-10-21 19:27:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 167 states have (on average 1.5389221556886228) internal successors, (257), 224 states have internal predecessors, (257), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (56), 47 states have call predecessors, (56), 46 states have call successors, (56) [2021-10-21 19:27:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 360 transitions. [2021-10-21 19:27:31,034 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 360 transitions. Word has length 29 [2021-10-21 19:27:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:31,035 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 360 transitions. [2021-10-21 19:27:31,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-10-21 19:27:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 360 transitions. [2021-10-21 19:27:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:27:31,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:31,038 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 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, 1] [2021-10-21 19:27:31,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-10-21 19:27:31,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:27:31,254 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sizeErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:27:31,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2009872658, now seen corresponding path program 1 times [2021-10-21 19:27:31,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:27:31,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879123614] [2021-10-21 19:27:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:31,255 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:27:31,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:27:31,256 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:27:31,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-21 19:27:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:31,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:27:31,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:27:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:27:31,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:27:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:27:32,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:27:32,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879123614] [2021-10-21 19:27:32,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879123614] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:32,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:32,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 10 [2021-10-21 19:27:32,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539907743] [2021-10-21 19:27:32,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:27:32,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:27:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:27:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:27:32,003 INFO L87 Difference]: Start difference. First operand 289 states and 360 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:27:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:32,497 INFO L93 Difference]: Finished difference Result 310 states and 370 transitions. [2021-10-21 19:27:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:27:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2021-10-21 19:27:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:32,503 INFO L225 Difference]: With dead ends: 310 [2021-10-21 19:27:32,503 INFO L226 Difference]: Without dead ends: 306 [2021-10-21 19:27:32,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 177.4ms TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:27:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-21 19:27:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 289. [2021-10-21 19:27:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 167 states have (on average 1.526946107784431) internal successors, (255), 224 states have internal predecessors, (255), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (56), 47 states have call predecessors, (56), 46 states have call successors, (56) [2021-10-21 19:27:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 358 transitions. [2021-10-21 19:27:32,532 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 358 transitions. Word has length 35 [2021-10-21 19:27:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:32,532 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 358 transitions. [2021-10-21 19:27:32,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:27:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 358 transitions. [2021-10-21 19:27:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:27:32,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:32,535 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2021-10-21 19:27:32,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-21 19:27:32,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:27:32,745 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting minErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:27:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash 439815457, now seen corresponding path program 1 times [2021-10-21 19:27:32,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:27:32,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207909078] [2021-10-21 19:27:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:32,747 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:27:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:27:32,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:27:32,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-21 19:27:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:33,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 35 conjunts are in the unsatisfiable core [2021-10-21 19:27:33,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:27:33,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-10-21 19:27:33,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-10-21 19:27:33,331 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-10-21 19:27:33,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2021-10-21 19:27:33,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:27:33,344 INFO L388 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 23 treesize of output 22 [2021-10-21 19:27:33,769 INFO L388 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 37 treesize of output 25 [2021-10-21 19:27:33,774 INFO L388 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 22 treesize of output 10 [2021-10-21 19:27:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:27:33,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:27:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:27:35,183 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:27:35,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207909078] [2021-10-21 19:27:35,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207909078] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:27:35,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:27:35,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2021-10-21 19:27:35,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300299291] [2021-10-21 19:27:35,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:27:35,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:27:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:27:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:27:35,185 INFO L87 Difference]: Start difference. First operand 289 states and 358 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:27:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:39,383 INFO L93 Difference]: Finished difference Result 334 states and 424 transitions. [2021-10-21 19:27:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:27:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2021-10-21 19:27:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:39,388 INFO L225 Difference]: With dead ends: 334 [2021-10-21 19:27:39,388 INFO L226 Difference]: Without dead ends: 334 [2021-10-21 19:27:39,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1172.3ms TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:27:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-10-21 19:27:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 293. [2021-10-21 19:27:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 170 states have (on average 1.5176470588235293) internal successors, (258), 227 states have internal predecessors, (258), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (56), 47 states have call predecessors, (56), 46 states have call successors, (56) [2021-10-21 19:27:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 361 transitions. [2021-10-21 19:27:39,405 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 361 transitions. Word has length 35 [2021-10-21 19:27:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:39,406 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 361 transitions. [2021-10-21 19:27:39,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:27:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 361 transitions. [2021-10-21 19:27:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:27:39,412 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:39,412 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:39,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-21 19:27:39,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:27:39,618 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting nondet_treeErr3REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:27:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash -438523152, now seen corresponding path program 2 times [2021-10-21 19:27:39,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:27:39,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923222046] [2021-10-21 19:27:39,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:27:39,619 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:27:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:27:39,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:27:39,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-21 19:27:40,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:27:40,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:27:40,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-21 19:27:40,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:27:40,146 INFO L388 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 [2021-10-21 19:27:40,153 INFO L388 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 [2021-10-21 19:27:40,820 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-10-21 19:27:40,820 INFO L388 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 2 case distinctions, treesize of input 32 treesize of output 36 [2021-10-21 19:27:40,842 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-21 19:27:40,842 INFO L388 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 33 treesize of output 33 [2021-10-21 19:27:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 34 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-21 19:27:40,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:27:46,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (or (let ((.cse0 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (and (bvule .cse0 (select |c_#length| v_nondet_tree_~n~0.base_BEFORE_CALL_22)) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) .cse0))) (exists ((v_nondet_tree_~n~0.base_46 (_ BitVec 32))) (and (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (exists ((v_nondet_tree_~n~0.base_47 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_46 (_ bv12 32)) v_nondet_tree_~n~0.base_47 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_46))))))) is different from false [2021-10-21 19:27:50,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_50 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store |c_#length| v_nondet_tree_~n~0.base_50 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (exists ((v_nondet_tree_~n~0.base_46 (_ BitVec 32))) (and (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (exists ((v_nondet_tree_~n~0.base_47 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_46 (_ bv12 32)) v_nondet_tree_~n~0.base_47 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_46))))))) is different from false [2021-10-21 19:27:50,731 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:27:50,731 INFO L388 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 177 treesize of output 181 [2021-10-21 19:27:50,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:27:50,769 INFO L388 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 181 treesize of output 185 [2021-10-21 19:27:58,050 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 1))) (let ((.cse1 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (let ((.cse0 (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) .cse1))) (or (and (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select |c_#length| v_nondet_tree_~n~0.base_BEFORE_CALL_22))) .cse0) (and (or (not .cse0) (not (bvule .cse1 (_ bv12 32))) (not (bvule .cse1 v_arrayElimCell_20))) (= (_ bv0 1) (bvneg v_arrayElimCell_21))) (exists ((v_prenex_7 (_ BitVec 32))) (let ((.cse3 (bvule (bvadd (_ bv4 32) v_prenex_7) (bvadd v_prenex_7 (_ bv8 32))))) (and (or (let ((.cse2 (bvadd (_ bv8 32) v_prenex_7))) (and (bvule .cse2 (_ bv12 32)) (bvule .cse2 v_arrayElimCell_20) .cse3)) (not (= (_ bv0 1) (bvneg v_arrayElimCell_21)))) (or (not .cse3) (exists ((v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (not (bvule (bvadd v_prenex_7 (_ bv8 32)) (select (store |c_old(#length)| v_nondet_tree_~n~0.base_50 (_ bv12 32)) v_prenex_8)))))))))))) is different from true [2021-10-21 19:28:14,222 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:28:14,222 INFO L388 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 199 treesize of output 203 [2021-10-21 19:28:59,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:28:59,457 INFO L388 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 199 treesize of output 203 [2021-10-21 19:32:05,260 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 1))) (let ((.cse1 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (let ((.cse0 (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) .cse1))) (or (and (or (not .cse0) (not (bvule .cse1 (_ bv12 32))) (not (bvule .cse1 v_arrayElimCell_20))) (= (_ bv0 1) (bvneg v_arrayElimCell_21))) (and (forall ((v_nondet_tree_~n~0.base_51 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store |c_#length| v_nondet_tree_~n~0.base_51 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))) .cse0) (exists ((v_prenex_7 (_ BitVec 32))) (let ((.cse3 (bvule (bvadd (_ bv4 32) v_prenex_7) (bvadd v_prenex_7 (_ bv8 32))))) (and (or (let ((.cse2 (bvadd (_ bv8 32) v_prenex_7))) (and (bvule .cse2 (_ bv12 32)) (bvule .cse2 v_arrayElimCell_20) .cse3)) (not (= (_ bv0 1) (bvneg v_arrayElimCell_21)))) (or (not .cse3) (exists ((v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (not (bvule (bvadd v_prenex_7 (_ bv8 32)) (select (store |c_old(#length)| v_nondet_tree_~n~0.base_50 (_ bv12 32)) v_prenex_8)))))))))))) is different from true [2021-10-21 19:32:06,921 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:32:06,921 INFO L388 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 180 treesize of output 184 [2021-10-21 19:32:06,972 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:32:06,973 INFO L388 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 184 treesize of output 188 [2021-10-21 19:32:13,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_nondet_tree_~n~0.base_52 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_50 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_52 (_ bv12 32)) v_nondet_tree_~n~0.base_50 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_52))) (exists ((v_nondet_tree_~n~0.base_46 (_ BitVec 32))) (and (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (exists ((v_nondet_tree_~n~0.base_47 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_46 (_ bv12 32)) v_nondet_tree_~n~0.base_47 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_46))))))) is different from false [2021-10-21 19:32:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 23 proven. 9 refuted. 2 times theorem prover too weak. 1 trivial. 31 not checked. [2021-10-21 19:32:14,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:32:14,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923222046] [2021-10-21 19:32:14,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923222046] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:32:14,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:32:14,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2021-10-21 19:32:14,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138949329] [2021-10-21 19:32:14,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-21 19:32:14,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:32:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-21 19:32:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=122, Unknown=8, NotChecked=130, Total=306 [2021-10-21 19:32:14,376 INFO L87 Difference]: Start difference. First operand 293 states and 361 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-10-21 19:32:21,775 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)))) (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ BitVec 32)) (v_nondet_tree_~n~0.base_52 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_22 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_50 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_52 (_ bv12 32)) v_nondet_tree_~n~0.base_50 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))) (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_52))) (exists ((v_nondet_tree_~n~0.base_46 (_ BitVec 32))) (and (or (not (bvule (bvadd (_ bv4 32) v_nondet_tree_~n~0.offset_BEFORE_CALL_12) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)))) (exists ((v_nondet_tree_~n~0.base_47 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_12 (_ bv8 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_46 (_ bv12 32)) v_nondet_tree_~n~0.base_47 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_22))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_46)))))))) is different from false [2021-10-21 19:33:06,038 WARN L207 SmtUtils]: Spent 5.35 s on a formula simplification that was a NOOP. DAG size: 41 [2021-10-21 19:33:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:33:21,067 INFO L93 Difference]: Finished difference Result 339 states and 412 transitions. [2021-10-21 19:33:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:33:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 46 [2021-10-21 19:33:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:33:21,092 INFO L225 Difference]: With dead ends: 339 [2021-10-21 19:33:21,092 INFO L226 Difference]: Without dead ends: 336 [2021-10-21 19:33:21,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 47902.4ms TimeCoverageRelationStatistics Valid=103, Invalid=253, Unknown=10, NotChecked=234, Total=600 [2021-10-21 19:33:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-21 19:33:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 326. [2021-10-21 19:33:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 252 states have internal predecessors, (295), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (56), 50 states have call predecessors, (56), 50 states have call successors, (56) [2021-10-21 19:33:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 402 transitions. [2021-10-21 19:33:21,109 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 402 transitions. Word has length 46 [2021-10-21 19:33:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:33:21,110 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 402 transitions. [2021-10-21 19:33:21,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-10-21 19:33:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 402 transitions. [2021-10-21 19:33:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-21 19:33:21,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:33:21,112 INFO L512 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:33:21,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-21 19:33:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:33:21,330 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting nondet_treeErr5REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:33:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:33:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1116627810, now seen corresponding path program 1 times [2021-10-21 19:33:21,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:33:21,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881730675] [2021-10-21 19:33:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:33:21,332 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:33:21,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:33:21,343 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:33:21,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-21 19:33:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:33:22,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-21 19:33:22,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:33:22,176 INFO L388 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 [2021-10-21 19:33:22,187 INFO L388 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 [2021-10-21 19:33:23,066 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-10-21 19:33:23,066 INFO L388 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 2 case distinctions, treesize of input 30 treesize of output 34 [2021-10-21 19:33:23,098 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-21 19:33:23,098 INFO L388 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 31 treesize of output 31 [2021-10-21 19:33:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-21 19:33:23,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:33:30,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_25 (_ BitVec 32))) (or (let ((.cse0 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (and (bvule .cse0 (select |c_#length| v_nondet_tree_~n~0.base_BEFORE_CALL_25)) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) .cse0))) (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25))))))))) is different from false [2021-10-21 19:33:54,848 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:33:54,849 INFO L388 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 179 treesize of output 183 [2021-10-21 19:33:54,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:33:54,910 INFO L388 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 183 treesize of output 187 [2021-10-21 19:33:59,003 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:33:59,003 INFO L388 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 182 treesize of output 186 [2021-10-21 19:33:59,060 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:33:59,061 INFO L388 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 186 treesize of output 190 [2021-10-21 19:34:07,523 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_41 (_ BitVec 1)) (v_arrayElimCell_38 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ BitVec 32))) (let ((.cse1 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (let ((.cse0 (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) .cse1))) (or (and (or (not .cse0) (not (bvule .cse1 (_ bv12 32))) (not (bvule .cse1 v_arrayElimCell_38))) (= (_ bv0 1) (bvneg (bvneg v_arrayElimCell_41)))) (and .cse0 (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_25 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store |c_#length| v_prenex_36 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25)))) (exists ((v_prenex_34 (_ BitVec 32))) (let ((.cse3 (bvadd v_prenex_34 (_ bv12 32)))) (let ((.cse2 (bvule (bvadd v_prenex_34 (_ bv8 32)) .cse3))) (and (or (not .cse2) (exists ((v_nondet_tree_~n~0.base_67 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (not (bvule (bvadd v_prenex_34 (_ bv12 32)) (select (store |c_old(#length)| v_nondet_tree_~n~0.base_67 (_ bv12 32)) v_prenex_35))))) (or (and (bvule .cse3 (_ bv12 32)) (bvule .cse3 v_arrayElimCell_38) .cse2) (not (= (_ bv0 1) (bvneg (bvneg (bvneg v_arrayElimCell_41)))))))))))))) is different from true [2021-10-21 19:34:18,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ BitVec 32)) (v_nondet_tree_~n~0.base_69 (_ BitVec 32)) (v_nondet_tree_~n~0.base_BEFORE_CALL_25 (_ BitVec 32))) (or (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25))))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_69))))))) (and (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32))) (forall ((v_nondet_tree_~n~0.base_67 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_69 (_ bv12 32)) v_nondet_tree_~n~0.base_67 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25)))))) is different from false [2021-10-21 19:34:22,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_26 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ BitVec 32)) (v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_63)))))) is different from false [2021-10-21 19:34:24,730 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_26 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ BitVec 32)) (v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_63)))))) is different from true [2021-10-21 19:34:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 5 refuted. 22 times theorem prover too weak. 5 trivial. 10 not checked. [2021-10-21 19:34:27,115 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:34:27,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881730675] [2021-10-21 19:34:27,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881730675] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-21 19:34:27,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:34:27,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2021-10-21 19:34:27,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718614873] [2021-10-21 19:34:27,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:34:27,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:34:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:34:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=98, Unknown=12, NotChecked=92, Total=240 [2021-10-21 19:34:27,118 INFO L87 Difference]: Start difference. First operand 326 states and 402 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 13 states have internal predecessors, (56), 7 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-21 19:34:45,621 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((v_arrayElimCell_41 (_ BitVec 1)) (v_arrayElimCell_38 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ BitVec 32))) (let ((.cse1 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (let ((.cse0 (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) .cse1))) (or (and (or (not .cse0) (not (bvule .cse1 (_ bv12 32))) (not (bvule .cse1 v_arrayElimCell_38))) (= (_ bv0 1) (bvneg (bvneg v_arrayElimCell_41)))) (and .cse0 (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_25 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store |c_#length| v_prenex_36 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25)))) (exists ((v_prenex_34 (_ BitVec 32))) (let ((.cse3 (bvadd v_prenex_34 (_ bv12 32)))) (let ((.cse2 (bvule (bvadd v_prenex_34 (_ bv8 32)) .cse3))) (and (or (not .cse2) (exists ((v_nondet_tree_~n~0.base_67 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (not (bvule (bvadd v_prenex_34 (_ bv12 32)) (select (store |c_old(#length)| v_nondet_tree_~n~0.base_67 (_ bv12 32)) v_prenex_35))))) (or (and (bvule .cse3 (_ bv12 32)) (bvule .cse3 v_arrayElimCell_38) .cse2) (not (= (_ bv0 1) (bvneg (bvneg (bvneg v_arrayElimCell_41)))))))))))))) (= |c_#length| |c_old(#length)|) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)))) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_26 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ BitVec 32)) (v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_63))))))) is different from false [2021-10-21 19:34:49,922 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((v_arrayElimCell_41 (_ BitVec 1)) (v_arrayElimCell_38 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ BitVec 32))) (let ((.cse1 (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)))) (let ((.cse0 (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv8 32)) .cse1))) (or (and (or (not .cse0) (not (bvule .cse1 (_ bv12 32))) (not (bvule .cse1 v_arrayElimCell_38))) (= (_ bv0 1) (bvneg (bvneg v_arrayElimCell_41)))) (and .cse0 (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_25 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_15 (_ bv12 32)) (select (store |c_#length| v_prenex_36 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_25)))) (exists ((v_prenex_34 (_ BitVec 32))) (let ((.cse3 (bvadd v_prenex_34 (_ bv12 32)))) (let ((.cse2 (bvule (bvadd v_prenex_34 (_ bv8 32)) .cse3))) (and (or (not .cse2) (exists ((v_nondet_tree_~n~0.base_67 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (not (bvule (bvadd v_prenex_34 (_ bv12 32)) (select (store |c_old(#length)| v_nondet_tree_~n~0.base_67 (_ bv12 32)) v_prenex_35))))) (or (and (bvule .cse3 (_ bv12 32)) (bvule .cse3 v_arrayElimCell_38) .cse2) (not (= (_ bv0 1) (bvneg (bvneg (bvneg v_arrayElimCell_41)))))))))))))) (= |c_#length| |c_old(#length)|) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_26 (_ BitVec 32)) (v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ BitVec 32)) (v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (or (and (forall ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_#length| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))) (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_63 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| v_nondet_tree_~n~0.base_63)))) (or (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv8 32)) (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)))) (exists ((v_nondet_tree_~n~0.base_64 (_ BitVec 32))) (not (bvule (bvadd v_nondet_tree_~n~0.offset_BEFORE_CALL_16 (_ bv12 32)) (select (store (store |c_old(#length)| v_nondet_tree_~n~0.base_63 (_ bv12 32)) v_nondet_tree_~n~0.base_64 (_ bv12 32)) v_nondet_tree_~n~0.base_BEFORE_CALL_26))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_nondet_tree_~n~0.base_63))))))) is different from false [2021-10-21 19:39:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:05,087 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2021-10-21 19:39:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:05,089 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 13 states have internal predecessors, (56), 7 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) Word has length 48 [2021-10-21 19:39:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:05,091 INFO L225 Difference]: With dead ends: 171 [2021-10-21 19:39:05,091 INFO L226 Difference]: Without dead ends: 162 [2021-10-21 19:39:05,092 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 41774.4ms TimeCoverageRelationStatistics Valid=51, Invalid=115, Unknown=14, NotChecked=162, Total=342 [2021-10-21 19:39:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-21 19:39:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-10-21 19:39:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 85 states have (on average 1.6) internal successors, (136), 132 states have internal predecessors, (136), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-10-21 19:39:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-10-21 19:39:05,098 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 48 [2021-10-21 19:39:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-10-21 19:39:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 13 states have internal predecessors, (56), 7 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-21 19:39:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-10-21 19:39:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:39:05,100 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:05,100 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:05,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-21 19:39:05,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:39:05,319 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting tree_inorderErr0REQUIRES_VIOLATION === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, tree_delErr0REQUIRES_VIOLATION, tree_delErr1REQUIRES_VIOLATION, tree_delErr2REQUIRES_VIOLATION (and 60 more)] === [2021-10-21 19:39:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1429211101, now seen corresponding path program 1 times [2021-10-21 19:39:05,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 19:39:05,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893478627] [2021-10-21 19:39:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:05,320 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 19:39:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 19:39:05,322 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 19:39:05,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-21 19:39:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:05,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:39:05,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:39:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:06,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 19:39:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:07,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 19:39:07,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893478627] [2021-10-21 19:39:07,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893478627] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:07,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:07,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2021-10-21 19:39:07,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914951347] [2021-10-21 19:39:07,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:07,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 19:39:07,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:07,270 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-10-21 19:39:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:07,461 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2021-10-21 19:39:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2021-10-21 19:39:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:07,462 INFO L225 Difference]: With dead ends: 28 [2021-10-21 19:39:07,462 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:39:07,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 481.3ms TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:39:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:39:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:39:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:39:07,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2021-10-21 19:39:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:07,464 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:39:07,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-10-21 19:39:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:39:07,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:39:07,468 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:39:07,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,473 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr4REQUIRES_VIOLATION [2021-10-21 19:39:07,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr5REQUIRES_VIOLATION [2021-10-21 19:39:07,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr6ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr7ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr8ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr9REQUIRES_VIOLATION [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr10REQUIRES_VIOLATION [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr11REQUIRES_VIOLATION [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr12REQUIRES_VIOLATION [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr13REQUIRES_VIOLATION [2021-10-21 19:39:07,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr14REQUIRES_VIOLATION [2021-10-21 19:39:07,476 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr15REQUIRES_VIOLATION [2021-10-21 19:39:07,476 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr16REQUIRES_VIOLATION [2021-10-21 19:39:07,476 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr17ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,477 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr18ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,477 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr19ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,477 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr20REQUIRES_VIOLATION [2021-10-21 19:39:07,478 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr21REQUIRES_VIOLATION [2021-10-21 19:39:07,478 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr22REQUIRES_VIOLATION [2021-10-21 19:39:07,478 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_delErr23REQUIRES_VIOLATION [2021-10-21 19:39:07,479 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,479 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,479 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,479 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,479 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr4REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location minErr5REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr4REQUIRES_VIOLATION [2021-10-21 19:39:07,480 INFO L764 garLoopResultBuilder]: Registering result SAFE for location nondet_treeErr5REQUIRES_VIOLATION [2021-10-21 19:39:07,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr4REQUIRES_VIOLATION [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr5REQUIRES_VIOLATION [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr6REQUIRES_VIOLATION [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr7REQUIRES_VIOLATION [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr8ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr9ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr10ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr11ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr12ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location taskErr13ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sizeErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sizeErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sizeErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location sizeErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr0REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr1REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr2REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr3REQUIRES_VIOLATION [2021-10-21 19:39:07,484 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr4REQUIRES_VIOLATION [2021-10-21 19:39:07,485 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr5REQUIRES_VIOLATION [2021-10-21 19:39:07,485 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr6REQUIRES_VIOLATION [2021-10-21 19:39:07,485 INFO L764 garLoopResultBuilder]: Registering result SAFE for location tree_inorderErr7REQUIRES_VIOLATION [2021-10-21 19:39:07,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-10-21 19:39:07,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 19:39:07,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:39:07,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:39:07 BoogieIcfgContainer [2021-10-21 19:39:07,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:39:07,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:39:07,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:39:07,708 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:39:07,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:12" (3/4) ... [2021-10-21 19:39:07,714 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:39:07,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-21 19:39:07,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_tree [2021-10-21 19:39:07,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-21 19:39:07,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure tree_del [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure min [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure task [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure size [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_cycle_if_not [2021-10-21 19:39:07,725 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-10-21 19:39:07,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2021-10-21 19:39:07,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure tree_inorder [2021-10-21 19:39:07,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2021-10-21 19:39:07,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-21 19:39:07,740 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-21 19:39:07,741 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:39:07,823 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:39:07,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:39:07,825 INFO L168 Benchmark]: Toolchain (without parser) took 777304.17 ms. Allocated memory was 58.7 MB in the beginning and 92.3 MB in the end (delta: 33.6 MB). Free memory was 36.9 MB in the beginning and 49.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,826 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 58.7 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:39:07,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.86 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 36.7 MB in the beginning and 56.1 MB in the end (delta: -19.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,827 INFO L168 Benchmark]: Boogie Preprocessor took 103.01 ms. Allocated memory is still 75.5 MB. Free memory was 56.1 MB in the beginning and 53.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,827 INFO L168 Benchmark]: RCFGBuilder took 1118.30 ms. Allocated memory is still 75.5 MB. Free memory was 53.3 MB in the beginning and 43.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,828 INFO L168 Benchmark]: TraceAbstraction took 775447.89 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 42.6 MB in the beginning and 55.6 MB in the end (delta: -13.0 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,828 INFO L168 Benchmark]: Witness Printer took 116.56 ms. Allocated memory is still 92.3 MB. Free memory was 55.6 MB in the beginning and 49.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:39:07,831 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.13 ms. Allocated memory is still 58.7 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 510.86 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 36.7 MB in the beginning and 56.1 MB in the end (delta: -19.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.01 ms. Allocated memory is still 75.5 MB. Free memory was 56.1 MB in the beginning and 53.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1118.30 ms. Allocated memory is still 75.5 MB. Free memory was 53.3 MB in the beginning and 43.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 775447.89 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 42.6 MB in the beginning and 55.6 MB in the end (delta: -13.0 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.1 GB. * Witness Printer took 116.56 ms. Allocated memory is still 92.3 MB. Free memory was 55.6 MB in the beginning and 49.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 109]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 56]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 56]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 60]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 60]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 62]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 62]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 62]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 65]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 65]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 93]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 93]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 96]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 96]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 104]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 104]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 104]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 104]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 105]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 105]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 105]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 106]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 106]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 106]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 82]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 82]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 82]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 82]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 73]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 73]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 74]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 74]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 74]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 74]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 75]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 75]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 208 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 775360.1ms, OverallIterations: 14, TraceHistogramMax: 6, EmptinessCheckTime: 51.7ms, AutomataDifference: 378438.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2535 SDtfs, 2290 SDslu, 9201 SDs, 0 SdLazy, 8404 SolverSat, 729 SolverUnsat, 195 SolverUnknown, 0 SolverNotchecked, 336424.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 776 GetRequests, 597 SyntacticMatches, 16 SemanticMatches, 163 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 113065.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=12, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 287.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 140 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 178.0ms SsaConstructionTime, 1114.0ms SatisfiabilityAnalysisTime, 389689.6ms InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 708 ConstructedInterpolants, 142 QuantifiedInterpolants, 8097 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2039 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 175/392 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 - AllSpecificationsHoldResult: All specifications hold 64 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-21 19:39:08,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b2d6a4-5b56-4e2e-a0cc-8beb17726e3b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...