./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:27:23,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:27:23,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:27:23,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:27:23,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:27:23,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:27:23,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:27:23,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:27:23,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:27:23,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:27:23,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:27:23,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:27:23,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:27:23,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:27:23,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:27:23,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:27:23,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:27:23,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:27:23,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:27:23,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:27:23,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:27:23,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:27:23,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:27:23,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:27:23,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:27:23,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:27:23,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:27:23,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:27:23,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:27:23,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:27:23,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:27:23,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:27:23,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:27:23,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:27:23,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:27:23,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:27:23,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:27:23,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:27:23,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:27:23,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:27:23,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:27:23,366 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 20:27:23,401 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:27:23,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:27:23,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:27:23,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:27:23,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:27:23,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:27:23,408 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:27:23,408 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:27:23,408 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:27:23,409 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:27:23,409 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:27:23,409 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:27:23,410 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:27:23,410 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:27:23,410 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:27:23,410 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:27:23,411 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:27:23,411 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:27:23,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 20:27:23,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 20:27:23,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:27:23,413 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:27:23,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 20:27:23,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:27:23,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:27:23,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:27:23,414 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 20:27:23,414 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 20:27:23,415 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 20:27:23,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:27:23,416 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 20:27:23,416 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:27:23,416 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:27:23,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:27:23,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:27:23,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:27:23,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:27:23,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:27:23,419 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:27:23,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:27:23,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:27:23,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:27:23,421 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/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_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2021-11-25 20:27:23,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:27:23,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:27:23,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:27:23,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:27:23,700 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:27:23,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2021-11-25 20:27:23,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/4ebcf527b/e61cfadfd7644791bb8bb30c755dd904/FLAG3424e9ca2 [2021-11-25 20:27:24,576 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:27:24,576 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2021-11-25 20:27:24,609 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/4ebcf527b/e61cfadfd7644791bb8bb30c755dd904/FLAG3424e9ca2 [2021-11-25 20:27:24,685 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/4ebcf527b/e61cfadfd7644791bb8bb30c755dd904 [2021-11-25 20:27:24,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:27:24,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:27:24,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:27:24,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:27:24,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:27:24,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:27:24" (1/1) ... [2021-11-25 20:27:24,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667bbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:24, skipping insertion in model container [2021-11-25 20:27:24,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:27:24" (1/1) ... [2021-11-25 20:27:24,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:27:24,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:27:25,236 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[33021,33034] [2021-11-25 20:27:25,527 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[84583,84596] [2021-11-25 20:27:25,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:27:25,541 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-11-25 20:27:25,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@234b2bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:25, skipping insertion in model container [2021-11-25 20:27:25,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:27:25,542 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-25 20:27:25,552 INFO L158 Benchmark]: Toolchain (without parser) took 860.93ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 81.9MB in the beginning and 130.9MB in the end (delta: -49.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 20:27:25,553 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:27:25,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 851.13ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 81.5MB in the beginning and 130.9MB in the end (delta: -49.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 20:27:25,557 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.25ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 851.13ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 81.5MB in the beginning and 130.9MB in the end (delta: -49.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:27:27,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:27:27,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:27:27,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:27:27,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:27:27,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:27:27,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:27:27,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:27:27,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:27:27,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:27:27,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:27:27,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:27:27,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:27:27,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:27:27,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:27:27,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:27:27,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:27:27,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:27:27,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:27:27,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:27:27,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:27:27,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:27:27,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:27:27,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:27:27,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:27:27,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:27:27,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:27:27,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:27:27,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:27:27,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:27:27,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:27:27,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:27:27,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:27:27,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:27:27,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:27:27,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:27:27,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:27:27,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:27:27,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:27:27,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:27:27,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:27:27,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-25 20:27:27,914 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:27:27,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:27:27,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:27:27,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:27:27,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:27:27,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:27:27,917 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:27:27,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:27:27,917 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:27:27,917 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:27:27,918 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:27:27,919 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:27:27,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 20:27:27,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 20:27:27,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:27:27,921 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:27:27,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 20:27:27,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:27:27,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:27:27,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:27:27,922 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 20:27:27,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 20:27:27,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 20:27:27,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:27:27,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 20:27:27,923 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 20:27:27,923 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 20:27:27,923 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:27:27,924 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:27:27,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:27:27,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 20:27:27,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:27:27,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:27:27,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:27:27,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:27:27,926 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 20:27:27,926 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 20:27:27,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:27:27,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:27:27,926 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_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/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_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2021-11-25 20:27:28,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:27:28,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:27:28,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:27:28,320 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:27:28,321 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:27:28,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2021-11-25 20:27:28,397 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/2d6bad4dd/5737ae2718a041ae85db47c3cedbf44d/FLAG20979e115 [2021-11-25 20:27:29,250 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:27:29,251 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2021-11-25 20:27:29,284 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/2d6bad4dd/5737ae2718a041ae85db47c3cedbf44d/FLAG20979e115 [2021-11-25 20:27:29,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/data/2d6bad4dd/5737ae2718a041ae85db47c3cedbf44d [2021-11-25 20:27:29,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:27:29,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:27:29,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:27:29,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:27:29,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:27:29,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:27:29" (1/1) ... [2021-11-25 20:27:29,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76149600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:29, skipping insertion in model container [2021-11-25 20:27:29,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:27:29" (1/1) ... [2021-11-25 20:27:29,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:27:29,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:27:29,992 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[33021,33034] [2021-11-25 20:27:30,323 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[84583,84596] [2021-11-25 20:27:30,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:27:30,363 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-25 20:27:30,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:27:30,418 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[33021,33034] [2021-11-25 20:27:30,647 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[84583,84596] [2021-11-25 20:27:30,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:27:30,655 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:27:30,700 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[33021,33034] [2021-11-25 20:27:30,829 WARN L230 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_7ae8c82b-6506-431c-9792-852c06a0f418/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i[84583,84596] [2021-11-25 20:27:30,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:27:30,897 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:27:30,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30 WrapperNode [2021-11-25 20:27:30,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:27:30,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:27:30,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:27:30,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:27:30,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:30,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,060 INFO L137 Inliner]: procedures = 180, calls = 730, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2870 [2021-11-25 20:27:31,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:27:31,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:27:31,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:27:31,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:27:31,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:27:31,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:27:31,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:27:31,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:27:31,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (1/1) ... [2021-11-25 20:27:31,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:27:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:27:31,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:27:31,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:27:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-25 20:27:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 20:27:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-25 20:27:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-25 20:27:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-25 20:27:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-25 20:27:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 20:27:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:27:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 20:27:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 20:27:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:27:31,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:27:31,752 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:27:31,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:27:31,758 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:27:37,535 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:27:37,568 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:27:37,568 INFO L301 CfgBuilder]: Removed 54 assume(true) statements. [2021-11-25 20:27:37,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:27:37 BoogieIcfgContainer [2021-11-25 20:27:37,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:27:37,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:27:37,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:27:37,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:27:37,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:27:29" (1/3) ... [2021-11-25 20:27:37,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:27:37, skipping insertion in model container [2021-11-25 20:27:37,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:27:30" (2/3) ... [2021-11-25 20:27:37,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:27:37, skipping insertion in model container [2021-11-25 20:27:37,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:27:37" (3/3) ... [2021-11-25 20:27:37,583 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-1.i [2021-11-25 20:27:37,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:27:37,589 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 431 error locations. [2021-11-25 20:27:37,647 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:27:37,656 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-11-25 20:27:37,656 INFO L340 AbstractCegarLoop]: Starting to check reachability of 431 error locations. [2021-11-25 20:27:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 1872 states, 938 states have (on average 2.1023454157782515) internal successors, (1972), 1866 states have internal predecessors, (1972), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:27:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-25 20:27:37,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:37,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-25 20:27:37,734 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2021-11-25 20:27:37,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:37,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423506404] [2021-11-25 20:27:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:37,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:37,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:37,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 20:27:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:37,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:27:37,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:38,051 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-11-25 20:27:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:38,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:38,075 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423506404] [2021-11-25 20:27:38,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423506404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:38,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:38,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:27:38,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915056023] [2021-11-25 20:27:38,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:38,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:27:38,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:27:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:38,135 INFO L87 Difference]: Start difference. First operand has 1872 states, 938 states have (on average 2.1023454157782515) internal successors, (1972), 1866 states have internal predecessors, (1972), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-25 20:27:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:40,931 INFO L93 Difference]: Finished difference Result 1859 states and 2905 transitions. [2021-11-25 20:27:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:27:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2021-11-25 20:27:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:40,976 INFO L225 Difference]: With dead ends: 1859 [2021-11-25 20:27:40,976 INFO L226 Difference]: Without dead ends: 1857 [2021-11-25 20:27:40,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:40,982 INFO L933 BasicCegarLoop]: 2515 mSDtfsCounter, 1794 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:40,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2297 Valid, 2562 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-25 20:27:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2021-11-25 20:27:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1856. [2021-11-25 20:27:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 938 states have (on average 2.0223880597014925) internal successors, (1897), 1850 states have internal predecessors, (1897), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:27:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2903 transitions. [2021-11-25 20:27:41,502 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2903 transitions. Word has length 3 [2021-11-25 20:27:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:41,502 INFO L470 AbstractCegarLoop]: Abstraction has 1856 states and 2903 transitions. [2021-11-25 20:27:41,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-25 20:27:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2903 transitions. [2021-11-25 20:27:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-25 20:27:41,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:41,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-25 20:27:41,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:41,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:27:41,716 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2021-11-25 20:27:41,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:41,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045319505] [2021-11-25 20:27:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:41,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:41,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:41,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 20:27:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:41,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:27:41,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:41,828 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-11-25 20:27:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:41,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:41,840 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045319505] [2021-11-25 20:27:41,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045319505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:41,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:41,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:27:41,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996441825] [2021-11-25 20:27:41,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:41,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:27:41,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:27:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:41,844 INFO L87 Difference]: Start difference. First operand 1856 states and 2903 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-25 20:27:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:45,338 INFO L93 Difference]: Finished difference Result 3065 states and 5133 transitions. [2021-11-25 20:27:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:27:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2021-11-25 20:27:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:45,367 INFO L225 Difference]: With dead ends: 3065 [2021-11-25 20:27:45,368 INFO L226 Difference]: Without dead ends: 3065 [2021-11-25 20:27:45,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:45,370 INFO L933 BasicCegarLoop]: 3303 mSDtfsCounter, 1230 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 5272 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:45,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1730 Valid, 5272 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-25 20:27:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-11-25 20:27:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2978. [2021-11-25 20:27:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 1561 states have (on average 2.0019218449711724) internal successors, (3125), 2972 states have internal predecessors, (3125), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2021-11-25 20:27:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 5131 transitions. [2021-11-25 20:27:45,743 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 5131 transitions. Word has length 3 [2021-11-25 20:27:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:45,743 INFO L470 AbstractCegarLoop]: Abstraction has 2978 states and 5131 transitions. [2021-11-25 20:27:45,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-25 20:27:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 5131 transitions. [2021-11-25 20:27:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 20:27:45,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:45,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:45,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:45,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:27:45,960 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2021-11-25 20:27:45,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:45,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770305406] [2021-11-25 20:27:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:45,963 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:45,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:45,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:45,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-25 20:27:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:46,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:27:46,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:46,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-11-25 20:27:46,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-11-25 20:27:46,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:27:46,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-11-25 20:27:46,263 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:27:46,264 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 17 treesize of output 17 [2021-11-25 20:27:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:46,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:46,295 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:46,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770305406] [2021-11-25 20:27:46,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770305406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:46,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:46,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:27:46,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445839190] [2021-11-25 20:27:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:46,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:27:46,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:27:46,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:27:46,299 INFO L87 Difference]: Start difference. First operand 2978 states and 5131 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-25 20:27:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:50,565 INFO L93 Difference]: Finished difference Result 2968 states and 5120 transitions. [2021-11-25 20:27:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:27:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-11-25 20:27:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:50,590 INFO L225 Difference]: With dead ends: 2968 [2021-11-25 20:27:50,590 INFO L226 Difference]: Without dead ends: 2968 [2021-11-25 20:27:50,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:27:50,592 INFO L933 BasicCegarLoop]: 2292 mSDtfsCounter, 1864 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2367 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:50,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2367 Valid, 2327 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-11-25 20:27:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2021-11-25 20:27:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1845. [2021-11-25 20:27:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 938 states have (on average 2.009594882729211) internal successors, (1885), 1839 states have internal predecessors, (1885), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:27:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2891 transitions. [2021-11-25 20:27:50,917 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2891 transitions. Word has length 7 [2021-11-25 20:27:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:50,918 INFO L470 AbstractCegarLoop]: Abstraction has 1845 states and 2891 transitions. [2021-11-25 20:27:50,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-25 20:27:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2891 transitions. [2021-11-25 20:27:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 20:27:50,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:50,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:50,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:51,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:27:51,135 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2021-11-25 20:27:51,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:51,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901482811] [2021-11-25 20:27:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:51,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:51,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:51,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:51,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-25 20:27:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:51,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:27:51,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:51,289 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-11-25 20:27:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:51,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:51,308 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:51,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901482811] [2021-11-25 20:27:51,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901482811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:51,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:51,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:27:51,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012168382] [2021-11-25 20:27:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:51,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:27:51,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:27:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:51,311 INFO L87 Difference]: Start difference. First operand 1845 states and 2891 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 20:27:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:53,872 INFO L93 Difference]: Finished difference Result 3011 states and 5078 transitions. [2021-11-25 20:27:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:27:53,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2021-11-25 20:27:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:53,897 INFO L225 Difference]: With dead ends: 3011 [2021-11-25 20:27:53,897 INFO L226 Difference]: Without dead ends: 3011 [2021-11-25 20:27:53,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:53,899 INFO L933 BasicCegarLoop]: 4655 mSDtfsCounter, 1804 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:53,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2307 Valid, 6811 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:27:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2021-11-25 20:27:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1798. [2021-11-25 20:27:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 938 states have (on average 1.9594882729211087) internal successors, (1838), 1792 states have internal predecessors, (1838), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:27:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2844 transitions. [2021-11-25 20:27:54,239 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2844 transitions. Word has length 8 [2021-11-25 20:27:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:54,240 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 2844 transitions. [2021-11-25 20:27:54,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 20:27:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2844 transitions. [2021-11-25 20:27:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 20:27:54,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:54,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:54,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:54,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:27:54,462 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2021-11-25 20:27:54,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519694212] [2021-11-25 20:27:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:54,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:54,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:54,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:54,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-25 20:27:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:54,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:27:54,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:54,603 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-11-25 20:27:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:54,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:54,633 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519694212] [2021-11-25 20:27:54,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519694212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:54,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:54,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:27:54,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543448498] [2021-11-25 20:27:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:54,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:27:54,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:27:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:54,636 INFO L87 Difference]: Start difference. First operand 1798 states and 2844 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 20:27:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:57,491 INFO L93 Difference]: Finished difference Result 3078 states and 5147 transitions. [2021-11-25 20:27:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:27:57,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2021-11-25 20:27:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:57,513 INFO L225 Difference]: With dead ends: 3078 [2021-11-25 20:27:57,513 INFO L226 Difference]: Without dead ends: 3078 [2021-11-25 20:27:57,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:27:57,516 INFO L933 BasicCegarLoop]: 4849 mSDtfsCounter, 1491 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 7169 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:57,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1991 Valid, 7169 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 20:27:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2021-11-25 20:27:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 1820. [2021-11-25 20:27:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 970 states have (on average 1.9525773195876288) internal successors, (1894), 1814 states have internal predecessors, (1894), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:27:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2900 transitions. [2021-11-25 20:27:57,873 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2900 transitions. Word has length 8 [2021-11-25 20:27:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:57,873 INFO L470 AbstractCegarLoop]: Abstraction has 1820 states and 2900 transitions. [2021-11-25 20:27:57,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 20:27:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2900 transitions. [2021-11-25 20:27:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 20:27:57,874 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:57,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:57,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:27:58,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:27:58,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:27:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2106406943, now seen corresponding path program 1 times [2021-11-25 20:27:58,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:27:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006481220] [2021-11-25 20:27:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:58,087 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:27:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:27:58,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:27:58,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-25 20:27:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:58,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 20:27:58,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:27:58,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:58,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:27:58,328 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-11-25 20:27:58,328 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 3 case distinctions, treesize of input 29 treesize of output 36 [2021-11-25 20:27:58,384 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-25 20:27:58,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2021-11-25 20:27:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:58,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:27:58,428 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:27:58,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006481220] [2021-11-25 20:27:58,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006481220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:58,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:58,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:27:58,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690158757] [2021-11-25 20:27:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:58,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:27:58,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:27:58,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:27:58,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:27:58,430 INFO L87 Difference]: Start difference. First operand 1820 states and 2900 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-25 20:28:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:01,736 INFO L93 Difference]: Finished difference Result 3028 states and 5128 transitions. [2021-11-25 20:28:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2021-11-25 20:28:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:01,766 INFO L225 Difference]: With dead ends: 3028 [2021-11-25 20:28:01,766 INFO L226 Difference]: Without dead ends: 3028 [2021-11-25 20:28:01,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:01,770 INFO L933 BasicCegarLoop]: 3292 mSDtfsCounter, 1225 mSDsluCounter, 5514 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:01,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1725 Valid, 8806 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 39 Unchecked, 3.2s Time] [2021-11-25 20:28:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2021-11-25 20:28:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1822. [2021-11-25 20:28:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 972 states have (on average 1.9506172839506173) internal successors, (1896), 1816 states have internal predecessors, (1896), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2902 transitions. [2021-11-25 20:28:02,076 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2902 transitions. Word has length 10 [2021-11-25 20:28:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:02,077 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2902 transitions. [2021-11-25 20:28:02,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-25 20:28:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2902 transitions. [2021-11-25 20:28:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:28:02,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:02,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:02,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:02,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:02,296 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2021-11-25 20:28:02,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:02,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196443480] [2021-11-25 20:28:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:02,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:02,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:02,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-25 20:28:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:02,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 20:28:02,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:02,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:02,476 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:02,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196443480] [2021-11-25 20:28:02,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196443480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:02,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:02,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:28:02,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879586139] [2021-11-25 20:28:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:02,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:28:02,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:28:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:28:02,479 INFO L87 Difference]: Start difference. First operand 1822 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-25 20:28:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:02,524 INFO L93 Difference]: Finished difference Result 1791 states and 2870 transitions. [2021-11-25 20:28:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:28:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2021-11-25 20:28:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:02,537 INFO L225 Difference]: With dead ends: 1791 [2021-11-25 20:28:02,537 INFO L226 Difference]: Without dead ends: 1791 [2021-11-25 20:28:02,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:28:02,538 INFO L933 BasicCegarLoop]: 2787 mSDtfsCounter, 1766 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:02,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2269 Valid, 3314 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:28:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2021-11-25 20:28:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1780. [2021-11-25 20:28:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 954 states have (on average 1.9423480083857443) internal successors, (1853), 1774 states have internal predecessors, (1853), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2859 transitions. [2021-11-25 20:28:02,713 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2859 transitions. Word has length 18 [2021-11-25 20:28:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:02,713 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 2859 transitions. [2021-11-25 20:28:02,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-25 20:28:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2859 transitions. [2021-11-25 20:28:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:02,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:02,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:02,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-25 20:28:02,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:02,927 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2021-11-25 20:28:02,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:02,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611728228] [2021-11-25 20:28:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:02,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:02,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:02,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-25 20:28:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:03,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:28:03,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:03,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:03,165 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611728228] [2021-11-25 20:28:03,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611728228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:03,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:03,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:28:03,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798258508] [2021-11-25 20:28:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:03,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:03,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:03,168 INFO L87 Difference]: Start difference. First operand 1780 states and 2859 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-25 20:28:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:03,274 INFO L93 Difference]: Finished difference Result 1770 states and 2842 transitions. [2021-11-25 20:28:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-25 20:28:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:03,295 INFO L225 Difference]: With dead ends: 1770 [2021-11-25 20:28:03,295 INFO L226 Difference]: Without dead ends: 1770 [2021-11-25 20:28:03,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:03,296 INFO L933 BasicCegarLoop]: 2742 mSDtfsCounter, 1737 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 6004 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:03,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2240 Valid, 6004 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:28:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2021-11-25 20:28:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1758. [2021-11-25 20:28:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 946 states have (on average 1.9281183932346724) internal successors, (1824), 1752 states have internal predecessors, (1824), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2830 transitions. [2021-11-25 20:28:03,472 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2830 transitions. Word has length 20 [2021-11-25 20:28:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:03,472 INFO L470 AbstractCegarLoop]: Abstraction has 1758 states and 2830 transitions. [2021-11-25 20:28:03,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-25 20:28:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2830 transitions. [2021-11-25 20:28:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:28:03,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:03,474 INFO L514 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] [2021-11-25 20:28:03,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:03,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:03,687 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2021-11-25 20:28:03,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:03,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795122970] [2021-11-25 20:28:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:03,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:03,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:03,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-25 20:28:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:03,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:28:03,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:03,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-11-25 20:28:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:03,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:03,992 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:03,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795122970] [2021-11-25 20:28:03,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795122970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:03,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:03,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:28:03,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229685919] [2021-11-25 20:28:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:03,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:03,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:03,993 INFO L87 Difference]: Start difference. First operand 1758 states and 2830 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-25 20:28:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:07,880 INFO L93 Difference]: Finished difference Result 2978 states and 5071 transitions. [2021-11-25 20:28:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) Word has length 34 [2021-11-25 20:28:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:07,900 INFO L225 Difference]: With dead ends: 2978 [2021-11-25 20:28:07,900 INFO L226 Difference]: Without dead ends: 2978 [2021-11-25 20:28:07,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:07,901 INFO L933 BasicCegarLoop]: 2886 mSDtfsCounter, 3337 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 6226 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:07,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3337 Valid, 6226 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-25 20:28:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2021-11-25 20:28:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1754. [2021-11-25 20:28:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 946 states have (on average 1.9238900634249472) internal successors, (1820), 1748 states have internal predecessors, (1820), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2826 transitions. [2021-11-25 20:28:08,280 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2826 transitions. Word has length 34 [2021-11-25 20:28:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:08,280 INFO L470 AbstractCegarLoop]: Abstraction has 1754 states and 2826 transitions. [2021-11-25 20:28:08,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-25 20:28:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2826 transitions. [2021-11-25 20:28:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:28:08,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:08,282 INFO L514 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] [2021-11-25 20:28:08,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:08,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:08,494 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2021-11-25 20:28:08,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878165100] [2021-11-25 20:28:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:08,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:08,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:08,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-25 20:28:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:08,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 20:28:08,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:08,703 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-11-25 20:28:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:08,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:08,946 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:08,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878165100] [2021-11-25 20:28:08,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878165100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:08,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:08,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:28:08,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946200003] [2021-11-25 20:28:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:08,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:08,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:08,948 INFO L87 Difference]: Start difference. First operand 1754 states and 2826 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-25 20:28:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:13,765 INFO L93 Difference]: Finished difference Result 3019 states and 5080 transitions. [2021-11-25 20:28:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) Word has length 34 [2021-11-25 20:28:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:13,785 INFO L225 Difference]: With dead ends: 3019 [2021-11-25 20:28:13,785 INFO L226 Difference]: Without dead ends: 3019 [2021-11-25 20:28:13,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:13,786 INFO L933 BasicCegarLoop]: 3079 mSDtfsCounter, 2786 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:13,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2786 Valid, 6725 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-11-25 20:28:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2021-11-25 20:28:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 1750. [2021-11-25 20:28:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 946 states have (on average 1.919661733615222) internal successors, (1816), 1744 states have internal predecessors, (1816), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2822 transitions. [2021-11-25 20:28:14,085 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2822 transitions. Word has length 34 [2021-11-25 20:28:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:14,085 INFO L470 AbstractCegarLoop]: Abstraction has 1750 states and 2822 transitions. [2021-11-25 20:28:14,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-25 20:28:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2822 transitions. [2021-11-25 20:28:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 20:28:14,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:14,087 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:14,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:14,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:14,300 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1723497600, now seen corresponding path program 1 times [2021-11-25 20:28:14,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:14,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053911676] [2021-11-25 20:28:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:14,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:14,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:14,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-25 20:28:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:14,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:28:14,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:14,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:14,663 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053911676] [2021-11-25 20:28:14,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053911676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:14,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:14,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:28:14,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159376166] [2021-11-25 20:28:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:14,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:14,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:14,666 INFO L87 Difference]: Start difference. First operand 1750 states and 2822 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-25 20:28:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:14,743 INFO L93 Difference]: Finished difference Result 1755 states and 2823 transitions. [2021-11-25 20:28:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) Word has length 49 [2021-11-25 20:28:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:14,756 INFO L225 Difference]: With dead ends: 1755 [2021-11-25 20:28:14,756 INFO L226 Difference]: Without dead ends: 1755 [2021-11-25 20:28:14,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:14,757 INFO L933 BasicCegarLoop]: 2736 mSDtfsCounter, 1713 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 5982 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:14,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2216 Valid, 5982 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:28:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-11-25 20:28:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1744. [2021-11-25 20:28:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 940 states have (on average 1.921276595744681) internal successors, (1806), 1738 states have internal predecessors, (1806), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2021-11-25 20:28:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2812 transitions. [2021-11-25 20:28:14,941 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2812 transitions. Word has length 49 [2021-11-25 20:28:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:14,942 INFO L470 AbstractCegarLoop]: Abstraction has 1744 states and 2812 transitions. [2021-11-25 20:28:14,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-25 20:28:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2812 transitions. [2021-11-25 20:28:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-25 20:28:14,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:14,944 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:14,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:15,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:15,157 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2061892788, now seen corresponding path program 1 times [2021-11-25 20:28:15,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:15,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29942503] [2021-11-25 20:28:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:15,160 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:15,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:15,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-25 20:28:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:15,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:28:15,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:15,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:15,776 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:15,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29942503] [2021-11-25 20:28:15,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29942503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:15,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:15,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:28:15,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451774389] [2021-11-25 20:28:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:15,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:28:15,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:28:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:28:15,778 INFO L87 Difference]: Start difference. First operand 1744 states and 2812 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-25 20:28:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:15,939 INFO L93 Difference]: Finished difference Result 2936 states and 5016 transitions. [2021-11-25 20:28:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:28:15,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 57 [2021-11-25 20:28:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:15,949 INFO L225 Difference]: With dead ends: 2936 [2021-11-25 20:28:15,949 INFO L226 Difference]: Without dead ends: 2936 [2021-11-25 20:28:15,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:28:15,950 INFO L933 BasicCegarLoop]: 3373 mSDtfsCounter, 1219 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:15,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1721 Valid, 5998 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:28:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2021-11-25 20:28:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2881. [2021-11-25 20:28:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 1577 states have (on average 1.9067850348763475) internal successors, (3007), 2875 states have internal predecessors, (3007), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2021-11-25 20:28:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 5013 transitions. [2021-11-25 20:28:16,281 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 5013 transitions. Word has length 57 [2021-11-25 20:28:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:16,282 INFO L470 AbstractCegarLoop]: Abstraction has 2881 states and 5013 transitions. [2021-11-25 20:28:16,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-25 20:28:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 5013 transitions. [2021-11-25 20:28:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-25 20:28:16,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:16,286 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:16,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:16,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:16,500 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2021-11-25 20:28:16,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:16,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615274266] [2021-11-25 20:28:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:16,501 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:16,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:16,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-25 20:28:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:16,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:28:16,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:16,819 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-11-25 20:28:16,825 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-11-25 20:28:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:17,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-11-25 20:28:17,492 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:28:17,492 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 15 treesize of output 15 [2021-11-25 20:28:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:17,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:17,512 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615274266] [2021-11-25 20:28:17,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615274266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:17,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:17,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:28:17,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448346580] [2021-11-25 20:28:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:17,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:17,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:17,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:17,515 INFO L87 Difference]: Start difference. First operand 2881 states and 5013 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-25 20:28:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:22,017 INFO L93 Difference]: Finished difference Result 5142 states and 9359 transitions. [2021-11-25 20:28:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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) Word has length 60 [2021-11-25 20:28:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:22,036 INFO L225 Difference]: With dead ends: 5142 [2021-11-25 20:28:22,036 INFO L226 Difference]: Without dead ends: 5142 [2021-11-25 20:28:22,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:22,037 INFO L933 BasicCegarLoop]: 2747 mSDtfsCounter, 2911 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3914 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:22,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3914 Valid, 3870 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-25 20:28:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2021-11-25 20:28:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2811. [2021-11-25 20:28:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 1545 states have (on average 1.8789644012944984) internal successors, (2903), 2805 states have internal predecessors, (2903), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2021-11-25 20:28:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 4909 transitions. [2021-11-25 20:28:22,617 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 4909 transitions. Word has length 60 [2021-11-25 20:28:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:22,618 INFO L470 AbstractCegarLoop]: Abstraction has 2811 states and 4909 transitions. [2021-11-25 20:28:22,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-25 20:28:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 4909 transitions. [2021-11-25 20:28:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 20:28:22,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:22,619 INFO L514 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, 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-11-25 20:28:22,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:22,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:22,833 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2021-11-25 20:28:22,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:22,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178248120] [2021-11-25 20:28:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:22,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:22,836 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:22,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-25 20:28:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:23,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 20:28:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:23,177 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-11-25 20:28:23,192 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-11-25 20:28:23,228 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 27 treesize of output 15 [2021-11-25 20:28:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:23,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:23,241 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178248120] [2021-11-25 20:28:23,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178248120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:23,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:23,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:28:23,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503812210] [2021-11-25 20:28:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:23,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:28:23,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:28:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:23,244 INFO L87 Difference]: Start difference. First operand 2811 states and 4909 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-11-25 20:28:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:25,147 INFO L93 Difference]: Finished difference Result 2810 states and 4908 transitions. [2021-11-25 20:28:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:28:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) Word has length 65 [2021-11-25 20:28:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:25,157 INFO L225 Difference]: With dead ends: 2810 [2021-11-25 20:28:25,157 INFO L226 Difference]: Without dead ends: 2810 [2021-11-25 20:28:25,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:28:25,158 INFO L933 BasicCegarLoop]: 2696 mSDtfsCounter, 4 mSDsluCounter, 7093 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9789 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:25,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 9789 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:28:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2021-11-25 20:28:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2021-11-25 20:28:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 1545 states have (on average 1.8783171521035598) internal successors, (2902), 2804 states have internal predecessors, (2902), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2021-11-25 20:28:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4908 transitions. [2021-11-25 20:28:25,528 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4908 transitions. Word has length 65 [2021-11-25 20:28:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:25,529 INFO L470 AbstractCegarLoop]: Abstraction has 2810 states and 4908 transitions. [2021-11-25 20:28:25,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-11-25 20:28:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4908 transitions. [2021-11-25 20:28:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 20:28:25,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:25,531 INFO L514 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, 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-11-25 20:28:25,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:25,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:25,745 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2021-11-25 20:28:25,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:25,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433604198] [2021-11-25 20:28:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:25,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:25,747 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:25,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-25 20:28:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:26,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 20:28:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:26,150 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-11-25 20:28:26,177 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-11-25 20:28:26,201 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-11-25 20:28:26,266 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 21 treesize of output 9 [2021-11-25 20:28:26,271 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 19 treesize of output 7 [2021-11-25 20:28:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:26,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:26,291 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433604198] [2021-11-25 20:28:26,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433604198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:26,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:26,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:28:26,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73999608] [2021-11-25 20:28:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:26,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:28:26,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:28:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:26,293 INFO L87 Difference]: Start difference. First operand 2810 states and 4908 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-11-25 20:28:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:28,655 INFO L93 Difference]: Finished difference Result 2809 states and 4907 transitions. [2021-11-25 20:28:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:28:28,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) Word has length 65 [2021-11-25 20:28:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:28,668 INFO L225 Difference]: With dead ends: 2809 [2021-11-25 20:28:28,668 INFO L226 Difference]: Without dead ends: 2809 [2021-11-25 20:28:28,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:28:28,672 INFO L933 BasicCegarLoop]: 2696 mSDtfsCounter, 2 mSDsluCounter, 7113 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9809 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:28,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 9809 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:28:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2021-11-25 20:28:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2021-11-25 20:28:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 1544 states have (on average 1.8788860103626943) internal successors, (2901), 2803 states have internal predecessors, (2901), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2021-11-25 20:28:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 4907 transitions. [2021-11-25 20:28:29,065 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 4907 transitions. Word has length 65 [2021-11-25 20:28:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:29,065 INFO L470 AbstractCegarLoop]: Abstraction has 2809 states and 4907 transitions. [2021-11-25 20:28:29,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-11-25 20:28:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 4907 transitions. [2021-11-25 20:28:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-25 20:28:29,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:29,067 INFO L514 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, 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-11-25 20:28:29,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:29,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:29,281 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2136756111, now seen corresponding path program 1 times [2021-11-25 20:28:29,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38112179] [2021-11-25 20:28:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:29,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:29,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:29,283 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:29,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-25 20:28:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:29,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:28:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:29,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:28:29,697 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:29,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38112179] [2021-11-25 20:28:29,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38112179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:29,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:29,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:28:29,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428294197] [2021-11-25 20:28:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:29,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:28:29,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:28:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:28:29,700 INFO L87 Difference]: Start difference. First operand 2809 states and 4907 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:28:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:29,781 INFO L93 Difference]: Finished difference Result 2812 states and 4911 transitions. [2021-11-25 20:28:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:28:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-11-25 20:28:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:29,794 INFO L225 Difference]: With dead ends: 2812 [2021-11-25 20:28:29,794 INFO L226 Difference]: Without dead ends: 2812 [2021-11-25 20:28:29,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:28:29,795 INFO L933 BasicCegarLoop]: 2696 mSDtfsCounter, 2 mSDsluCounter, 5387 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8083 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:29,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 8083 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:28:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2021-11-25 20:28:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2021-11-25 20:28:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 1546 states have (on average 1.8783958602846054) internal successors, (2904), 2806 states have internal predecessors, (2904), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:28:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4911 transitions. [2021-11-25 20:28:30,264 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4911 transitions. Word has length 73 [2021-11-25 20:28:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:30,264 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 4911 transitions. [2021-11-25 20:28:30,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:28:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4911 transitions. [2021-11-25 20:28:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-25 20:28:30,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:30,265 INFO L514 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, 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-11-25 20:28:30,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:30,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:30,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 386181462, now seen corresponding path program 1 times [2021-11-25 20:28:30,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740629024] [2021-11-25 20:28:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:30,481 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:30,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:30,482 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:30,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-25 20:28:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:30,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:28:30,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:30,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:31,020 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:31,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740629024] [2021-11-25 20:28:31,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740629024] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:31,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275575290] [2021-11-25 20:28:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:31,021 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:28:31,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:28:31,027 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:28:31,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-11-25 20:28:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:31,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:28:31,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:31,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:31,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1275575290] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:31,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237740982] [2021-11-25 20:28:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:31,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:28:31,704 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:28:31,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 20:28:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:31,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 20:28:31,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:32,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237740982] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:32,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 20:28:32,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2021-11-25 20:28:32,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412017935] [2021-11-25 20:28:32,250 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 20:28:32,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:28:32,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:28:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:28:32,253 INFO L87 Difference]: Start difference. First operand 2812 states and 4911 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:28:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:32,493 INFO L93 Difference]: Finished difference Result 2824 states and 4928 transitions. [2021-11-25 20:28:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:28:32,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2021-11-25 20:28:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:32,509 INFO L225 Difference]: With dead ends: 2824 [2021-11-25 20:28:32,510 INFO L226 Difference]: Without dead ends: 2824 [2021-11-25 20:28:32,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:28:32,511 INFO L933 BasicCegarLoop]: 2697 mSDtfsCounter, 16 mSDsluCounter, 10770 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13467 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:32,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 13467 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:28:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2021-11-25 20:28:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2822. [2021-11-25 20:28:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 1555 states have (on average 1.8771704180064308) internal successors, (2919), 2815 states have internal predecessors, (2919), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:28:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4926 transitions. [2021-11-25 20:28:32,920 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4926 transitions. Word has length 74 [2021-11-25 20:28:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:32,920 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 4926 transitions. [2021-11-25 20:28:32,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:28:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4926 transitions. [2021-11-25 20:28:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-25 20:28:32,922 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:32,922 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:32,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-25 20:28:33,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:33,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:33,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:28:33,536 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:28:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1401424207, now seen corresponding path program 2 times [2021-11-25 20:28:33,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:28:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732043178] [2021-11-25 20:28:33,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:28:33,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:28:33,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:28:33,539 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:28:33,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-25 20:28:33,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:28:33,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:28:33,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 20:28:33,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:34,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:34,491 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:28:34,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732043178] [2021-11-25 20:28:34,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732043178] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1966449492] [2021-11-25 20:28:34,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:28:34,492 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:28:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:28:34,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:28:34,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2021-11-25 20:28:36,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:28:36,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:28:36,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 20:28:36,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:36,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:36,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1966449492] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:36,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753958571] [2021-11-25 20:28:36,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:28:36,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:28:36,371 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:28:36,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 20:28:52,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:28:52,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:28:52,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-25 20:28:52,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:52,064 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-11-25 20:28:52,253 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:28:52,254 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 16 treesize of output 16 [2021-11-25 20:28:52,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:28:52,321 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-11-25 20:28:52,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:28:52,509 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-11-25 20:28:52,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-25 20:28:52,676 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1629) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:28:52,708 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1630))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1631)))) is different from true [2021-11-25 20:28:52,726 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1632) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1633) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:28:52,824 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:28:52,825 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:28:52,833 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 22 treesize of output 24 [2021-11-25 20:28:52,924 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 31 treesize of output 13 [2021-11-25 20:28:52,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2021-11-25 20:28:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-11-25 20:28:52,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:53,274 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_1644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 20:28:53,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753958571] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:28:53,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 20:28:53,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2021-11-25 20:28:53,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726796470] [2021-11-25 20:28:53,282 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 20:28:53,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:28:53,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:28:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:28:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=417, Unknown=14, NotChecked=180, Total=702 [2021-11-25 20:28:53,284 INFO L87 Difference]: Start difference. First operand 2822 states and 4926 transitions. Second operand has 24 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 20:29:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:07,479 INFO L93 Difference]: Finished difference Result 5142 states and 9336 transitions. [2021-11-25 20:29:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:29:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2021-11-25 20:29:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:07,500 INFO L225 Difference]: With dead ends: 5142 [2021-11-25 20:29:07,500 INFO L226 Difference]: Without dead ends: 5136 [2021-11-25 20:29:07,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=346, Invalid=2064, Unknown=56, NotChecked=396, Total=2862 [2021-11-25 20:29:07,502 INFO L933 BasicCegarLoop]: 2875 mSDtfsCounter, 1654 mSDsluCounter, 37311 mSDsCounter, 0 mSdLazyCounter, 7063 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 40186 SdHoareTripleChecker+Invalid, 19962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12864 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:07,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 40186 Invalid, 19962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 7063 Invalid, 0 Unknown, 12864 Unchecked, 12.4s Time] [2021-11-25 20:29:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2021-11-25 20:29:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 2829. [2021-11-25 20:29:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 1563 states have (on average 1.872680742162508) internal successors, (2927), 2822 states have internal predecessors, (2927), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:29:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4934 transitions. [2021-11-25 20:29:08,225 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4934 transitions. Word has length 77 [2021-11-25 20:29:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:08,225 INFO L470 AbstractCegarLoop]: Abstraction has 2829 states and 4934 transitions. [2021-11-25 20:29:08,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 20:29:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4934 transitions. [2021-11-25 20:29:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-25 20:29:08,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:08,227 INFO L514 BasicCegarLoop]: trace histogram [9, 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, 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-11-25 20:29:08,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:08,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:08,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:08,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 20:29:08,840 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:29:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash -818772523, now seen corresponding path program 1 times [2021-11-25 20:29:08,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:29:08,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944283971] [2021-11-25 20:29:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:08,844 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:29:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:29:08,845 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:29:08,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-25 20:29:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:09,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 20:29:09,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:09,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:09,939 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:29:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944283971] [2021-11-25 20:29:09,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944283971] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808532655] [2021-11-25 20:29:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:09,940 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:29:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:29:09,941 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:29:09,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-11-25 20:29:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 20:29:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:10,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:10,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1808532655] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817745252] [2021-11-25 20:29:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:10,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:29:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:29:10,785 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:29:10,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 20:29:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:11,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 20:29:11,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:11,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:12,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817745252] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:12,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 20:29:12,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2021-11-25 20:29:12,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981146368] [2021-11-25 20:29:12,018 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 20:29:12,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 20:29:12,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:29:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 20:29:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 20:29:12,021 INFO L87 Difference]: Start difference. First operand 2829 states and 4934 transitions. Second operand has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:29:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:14,706 INFO L93 Difference]: Finished difference Result 2871 states and 4987 transitions. [2021-11-25 20:29:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 20:29:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 82 [2021-11-25 20:29:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:14,716 INFO L225 Difference]: With dead ends: 2871 [2021-11-25 20:29:14,716 INFO L226 Difference]: Without dead ends: 2861 [2021-11-25 20:29:14,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 20:29:14,718 INFO L933 BasicCegarLoop]: 2703 mSDtfsCounter, 135 mSDsluCounter, 35074 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 37777 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:14,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 37777 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:29:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2021-11-25 20:29:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2845. [2021-11-25 20:29:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 1579 states have (on average 1.8651044965167827) internal successors, (2945), 2838 states have internal predecessors, (2945), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:29:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4952 transitions. [2021-11-25 20:29:15,096 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4952 transitions. Word has length 82 [2021-11-25 20:29:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:15,096 INFO L470 AbstractCegarLoop]: Abstraction has 2845 states and 4952 transitions. [2021-11-25 20:29:15,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.0) internal successors, (105), 35 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:29:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4952 transitions. [2021-11-25 20:29:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-25 20:29:15,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:15,098 INFO L514 BasicCegarLoop]: trace histogram [20, 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, 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-11-25 20:29:15,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:15,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:15,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:15,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:29:15,704 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:29:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1360670798, now seen corresponding path program 2 times [2021-11-25 20:29:15,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:29:15,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502229725] [2021-11-25 20:29:15,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:29:15,705 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:29:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:29:15,706 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:29:15,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-25 20:29:16,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:29:16,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:29:16,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 20:29:16,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:16,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:18,254 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:29:18,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502229725] [2021-11-25 20:29:18,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502229725] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:18,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1477534118] [2021-11-25 20:29:18,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:29:18,255 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:29:18,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:29:18,256 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:29:18,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-11-25 20:29:20,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:29:20,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:29:20,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 20:29:20,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:20,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:20,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1477534118] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:20,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530355343] [2021-11-25 20:29:20,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:29:20,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:29:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:29:20,791 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:29:20,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 20:30:22,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 20:30:22,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:30:22,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-25 20:30:22,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:30:22,783 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-11-25 20:30:22,974 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:30:22,975 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 19 treesize of output 19 [2021-11-25 20:30:23,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:30:25,275 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:30:25,275 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 20:30:25,401 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 35 treesize of output 17 [2021-11-25 20:30:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-25 20:30:25,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:30:25,743 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-11-25 20:30:25,743 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 34 treesize of output 33 [2021-11-25 20:30:25,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2842) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2021-11-25 20:30:25,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530355343] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:30:25,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 20:30:25,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 10] total 55 [2021-11-25 20:30:25,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027824787] [2021-11-25 20:30:25,753 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 20:30:25,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-25 20:30:25,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:30:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-25 20:30:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2483, Unknown=2, NotChecked=108, Total=3192 [2021-11-25 20:30:25,757 INFO L87 Difference]: Start difference. First operand 2845 states and 4952 transitions. Second operand has 55 states, 54 states have (on average 3.388888888888889) internal successors, (183), 54 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 20:31:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:03,965 INFO L93 Difference]: Finished difference Result 5246 states and 9490 transitions. [2021-11-25 20:31:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-25 20:31:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.388888888888889) internal successors, (183), 54 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 93 [2021-11-25 20:31:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:03,981 INFO L225 Difference]: With dead ends: 5246 [2021-11-25 20:31:03,982 INFO L226 Difference]: Without dead ends: 5242 [2021-11-25 20:31:03,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 389 SyntacticMatches, 20 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2250 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2273, Invalid=9631, Unknown=90, NotChecked=216, Total=12210 [2021-11-25 20:31:03,987 INFO L933 BasicCegarLoop]: 2910 mSDtfsCounter, 1644 mSDsluCounter, 74767 mSDsCounter, 0 mSdLazyCounter, 16164 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 77677 SdHoareTripleChecker+Invalid, 19712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 16164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2485 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:03,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2145 Valid, 77677 Invalid, 19712 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1063 Valid, 16164 Invalid, 0 Unknown, 2485 Unchecked, 24.5s Time] [2021-11-25 20:31:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-25 20:31:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2865. [2021-11-25 20:31:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 1600 states have (on average 1.853125) internal successors, (2965), 2858 states have internal predecessors, (2965), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:31:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4972 transitions. [2021-11-25 20:31:04,602 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4972 transitions. Word has length 93 [2021-11-25 20:31:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:04,602 INFO L470 AbstractCegarLoop]: Abstraction has 2865 states and 4972 transitions. [2021-11-25 20:31:04,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.388888888888889) internal successors, (183), 54 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 20:31:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4972 transitions. [2021-11-25 20:31:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-25 20:31:04,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:04,604 INFO L514 BasicCegarLoop]: trace histogram [41, 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, 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-11-25 20:31:04,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 20:31:04,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-11-25 20:31:05,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-25 20:31:05,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:31:05,220 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:31:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1003428623, now seen corresponding path program 1 times [2021-11-25 20:31:05,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:31:05,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270313029] [2021-11-25 20:31:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:05,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:31:05,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:31:05,223 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:31:05,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-25 20:31:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:05,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 20:31:05,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:06,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:31:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:11,954 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:31:11,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270313029] [2021-11-25 20:31:11,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270313029] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:31:11,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [663975628] [2021-11-25 20:31:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:11,955 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:31:11,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:31:11,956 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:31:11,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2021-11-25 20:31:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:12,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 20:31:12,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:13,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:31:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:14,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [663975628] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:31:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135066040] [2021-11-25 20:31:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:14,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:31:14,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:31:14,104 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:31:14,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-25 20:31:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:14,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 20:31:14,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:15,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:31:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:23,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135066040] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:31:23,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 20:31:23,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2021-11-25 20:31:23,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187454410] [2021-11-25 20:31:23,561 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 20:31:23,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2021-11-25 20:31:23,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:31:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2021-11-25 20:31:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2021-11-25 20:31:23,571 INFO L87 Difference]: Start difference. First operand 2865 states and 4972 transitions. Second operand has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:33:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:59,765 INFO L93 Difference]: Finished difference Result 3024 states and 5203 transitions. [2021-11-25 20:33:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2021-11-25 20:33:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2021-11-25 20:33:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:59,774 INFO L225 Difference]: With dead ends: 3024 [2021-11-25 20:33:59,774 INFO L226 Difference]: Without dead ends: 3018 [2021-11-25 20:33:59,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7488 ImplicationChecksByTransitivity, 156.2s TimeCoverageRelationStatistics Valid=18423, Invalid=46857, Unknown=0, NotChecked=0, Total=65280 [2021-11-25 20:33:59,789 INFO L933 BasicCegarLoop]: 2733 mSDtfsCounter, 1044 mSDsluCounter, 128095 mSDsCounter, 0 mSdLazyCounter, 7056 mSolverCounterSat, 1314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 130828 SdHoareTripleChecker+Invalid, 8370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1314 IncrementalHoareTripleChecker+Valid, 7056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:59,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1044 Valid, 130828 Invalid, 8370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1314 Valid, 7056 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2021-11-25 20:33:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2021-11-25 20:34:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2940. [2021-11-25 20:34:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 1675 states have (on average 1.8340298507462687) internal successors, (3072), 2933 states have internal predecessors, (3072), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:34:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 5079 transitions. [2021-11-25 20:34:00,129 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 5079 transitions. Word has length 117 [2021-11-25 20:34:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:34:00,129 INFO L470 AbstractCegarLoop]: Abstraction has 2940 states and 5079 transitions. [2021-11-25 20:34:00,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5572519083969465) internal successors, (204), 131 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:34:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 5079 transitions. [2021-11-25 20:34:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-25 20:34:00,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:34:00,132 INFO L514 BasicCegarLoop]: trace histogram [44, 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, 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-11-25 20:34:00,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:00,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:00,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:00,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:34:00,748 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:34:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:34:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1188733784, now seen corresponding path program 2 times [2021-11-25 20:34:00,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:34:00,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611534938] [2021-11-25 20:34:00,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 20:34:00,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:34:00,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:34:00,751 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:34:00,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-11-25 20:34:01,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 20:34:01,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:34:01,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-25 20:34:01,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:34:01,550 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-11-25 20:34:01,556 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-11-25 20:34:02,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:34:02,037 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 15 treesize of output 15 [2021-11-25 20:34:02,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-11-25 20:34:02,324 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:34:02,325 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2021-11-25 20:34:02,340 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:02,341 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 19 treesize of output 23 [2021-11-25 20:34:02,517 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 20:34:02,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2021-11-25 20:34:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-25 20:34:02,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:34:02,560 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:34:02,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611534938] [2021-11-25 20:34:02,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611534938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:34:02,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:34:02,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:34:02,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041019477] [2021-11-25 20:34:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:34:02,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:34:02,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:34:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:34:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:34:02,562 INFO L87 Difference]: Start difference. First operand 2940 states and 5079 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:34:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:34:16,431 INFO L93 Difference]: Finished difference Result 7835 states and 14156 transitions. [2021-11-25 20:34:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:34:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2021-11-25 20:34:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:34:16,475 INFO L225 Difference]: With dead ends: 7835 [2021-11-25 20:34:16,475 INFO L226 Difference]: Without dead ends: 7835 [2021-11-25 20:34:16,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:34:16,476 INFO L933 BasicCegarLoop]: 5309 mSDtfsCounter, 2869 mSDsluCounter, 23015 mSDsCounter, 0 mSdLazyCounter, 8852 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3870 SdHoareTripleChecker+Valid, 28324 SdHoareTripleChecker+Invalid, 12139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 8852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3276 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:34:16,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3870 Valid, 28324 Invalid, 12139 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 8852 Invalid, 0 Unknown, 3276 Unchecked, 13.5s Time] [2021-11-25 20:34:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2021-11-25 20:34:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 2939. [2021-11-25 20:34:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 1675 states have (on average 1.8334328358208956) internal successors, (3071), 2932 states have internal predecessors, (3071), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:34:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 5078 transitions. [2021-11-25 20:34:17,513 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 5078 transitions. Word has length 120 [2021-11-25 20:34:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:34:17,513 INFO L470 AbstractCegarLoop]: Abstraction has 2939 states and 5078 transitions. [2021-11-25 20:34:17,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:34:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 5078 transitions. [2021-11-25 20:34:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-25 20:34:17,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:34:17,515 INFO L514 BasicCegarLoop]: trace histogram [44, 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, 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-11-25 20:34:17,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:17,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 20:34:17,732 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:34:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:34:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1188733785, now seen corresponding path program 1 times [2021-11-25 20:34:17,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:34:17,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356950696] [2021-11-25 20:34:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:34:17,735 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:34:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:34:17,736 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:34:17,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-11-25 20:34:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:34:18,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 20:34:18,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:34:18,684 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-11-25 20:34:18,821 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:34:18,821 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 18 treesize of output 18 [2021-11-25 20:34:18,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:34:18,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:34:18,859 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-11-25 20:34:18,958 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-11-25 20:34:18,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-25 20:34:19,016 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4678) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4677) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4680) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4679 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4679) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,046 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4682 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4682) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4681 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4681) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,058 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,077 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4685 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:34:19,100 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687))) (exists ((v_ArrVal_4688 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,116 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4689) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4690 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4690) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,133 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4691) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692)))) is different from true [2021-11-25 20:34:19,154 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,237 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,249 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,310 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705)))) is different from true [2021-11-25 20:34:19,326 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,343 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,359 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2021-11-25 20:34:19,376 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,392 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4716) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,408 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,424 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,440 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,456 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,471 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,486 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,503 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,518 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:34:19,533 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,549 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:34:19,565 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,580 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,595 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:34:19,612 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,645 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,660 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:34:19,676 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,692 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,706 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,722 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,737 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,752 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,768 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:34:19,820 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:34:19,820 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:34:19,827 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 22 treesize of output 24 [2021-11-25 20:34:19,958 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:34:19,959 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:34:19,965 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 22 treesize of output 24 [2021-11-25 20:34:20,008 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 31 treesize of output 13 [2021-11-25 20:34:20,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2021-11-25 20:34:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2021-11-25 20:34:20,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:34:20,224 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-11-25 20:34:20,257 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 20:34:21,067 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4858)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4857) .cse0 v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4857) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2021-11-25 20:34:21,079 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:34:21,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356950696] [2021-11-25 20:34:21,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356950696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:34:21,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403283082] [2021-11-25 20:34:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:34:21,080 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:34:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:34:21,080 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:34:21,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-11-25 20:36:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:36:12,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-25 20:36:12,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:36:12,850 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-11-25 20:36:12,983 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-11-25 20:36:12,998 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:36:12,998 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 16 treesize of output 16 [2021-11-25 20:36:13,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:36:13,025 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-11-25 20:36:13,099 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-11-25 20:36:13,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-25 20:36:13,174 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,190 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5242))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,206 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,222 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,235 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251)))) is different from true [2021-11-25 20:36:13,265 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,289 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,303 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,325 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259)))) is different from true [2021-11-25 20:36:13,337 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260))) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,350 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,361 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,388 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,400 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,412 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,424 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,453 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,465 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,477 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,489 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,502 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,514 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,526 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,538 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:13,550 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,564 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,585 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299)))) is different from true [2021-11-25 20:36:13,598 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,610 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,622 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,633 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:13,652 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,708 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,724 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,737 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,749 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,761 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:13,772 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,784 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:13,811 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:13,869 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:13,870 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:36:13,877 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 22 treesize of output 24 [2021-11-25 20:36:13,975 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:13,975 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:36:13,982 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 22 treesize of output 24 [2021-11-25 20:36:14,020 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 31 treesize of output 13 [2021-11-25 20:36:14,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2021-11-25 20:36:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2021-11-25 20:36:14,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:36:14,121 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2021-11-25 20:36:14,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 20:36:14,890 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5420) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5421)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5420) .cse2 v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 20:36:14,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1403283082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:36:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947794968] [2021-11-25 20:36:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:36:14,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:36:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:36:14,903 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:36:14,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-25 20:36:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:36:15,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 20:36:15,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:36:15,444 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-11-25 20:36:15,571 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-11-25 20:36:15,586 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:36:15,586 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 17 treesize of output 17 [2021-11-25 20:36:15,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:36:15,618 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-11-25 20:36:15,678 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-11-25 20:36:15,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-25 20:36:15,730 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5803) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,795 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:15,810 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,826 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,839 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,855 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,875 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:15,891 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,907 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:15,923 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,939 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:15,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,972 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:15,991 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,006 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833))) (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,020 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,048 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,103 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,114 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,126 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5845) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5846) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,138 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5848))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5847)))) is different from true [2021-11-25 20:36:16,157 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850))) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,169 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:16,181 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,193 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:16,232 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,244 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,256 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:16,267 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866))) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,279 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,307 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870))) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,322 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,339 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,354 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,408 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,424 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,440 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,492 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,508 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:16,564 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:16,565 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:36:16,571 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 22 treesize of output 24 [2021-11-25 20:36:16,657 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:16,658 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:36:16,663 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 22 treesize of output 24 [2021-11-25 20:36:16,703 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 31 treesize of output 13 [2021-11-25 20:36:16,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2021-11-25 20:36:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2021-11-25 20:36:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:36:16,798 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-11-25 20:36:16,842 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 20:36:17,540 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5984)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5983) .cse0 v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5983) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2021-11-25 20:36:17,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947794968] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:36:17,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:36:17,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 52, 49] total 133 [2021-11-25 20:36:17,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579878680] [2021-11-25 20:36:17,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:36:17,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2021-11-25 20:36:17,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:36:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2021-11-25 20:36:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=232, Unknown=139, NotChecked=20216, Total=20880 [2021-11-25 20:36:17,555 INFO L87 Difference]: Start difference. First operand 2939 states and 5078 transitions. Second operand has 134 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 134 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:36:18,033 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4678) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4677) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5803) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:18,037 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5242))) (exists ((v_ArrVal_4680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4680) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4679 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4679) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:18,042 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245))) (exists ((v_ArrVal_4682 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4682) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4681 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4681) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:18,049 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4684 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4683))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810))) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:36:18,079 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_4687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4688 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251)))) is different from true [2021-11-25 20:36:18,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4689) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4690 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4690) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:18,099 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4716) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870))) (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4691) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2021-11-25 20:36:18,564 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32)))) is different from true [2021-11-25 20:36:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:36:27,886 INFO L93 Difference]: Finished difference Result 5241 states and 9468 transitions. [2021-11-25 20:36:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:36:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 134 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 134 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2021-11-25 20:36:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:36:27,902 INFO L225 Difference]: With dead ends: 5241 [2021-11-25 20:36:27,903 INFO L226 Difference]: Without dead ends: 5241 [2021-11-25 20:36:27,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 222 SyntacticMatches, 15 SemanticMatches, 158 ConstructedPredicates, 141 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=398, Unknown=154, NotChecked=24534, Total=25440 [2021-11-25 20:36:27,906 INFO L933 BasicCegarLoop]: 2873 mSDtfsCounter, 1611 mSDsluCounter, 15636 mSDsCounter, 0 mSdLazyCounter, 4252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2113 SdHoareTripleChecker+Valid, 18509 SdHoareTripleChecker+Invalid, 619113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614851 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:36:27,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2113 Valid, 18509 Invalid, 619113 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [10 Valid, 4252 Invalid, 0 Unknown, 614851 Unchecked, 8.9s Time] [2021-11-25 20:36:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5241 states. [2021-11-25 20:36:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5241 to 2938. [2021-11-25 20:36:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 1675 states have (on average 1.8328358208955224) internal successors, (3070), 2931 states have internal predecessors, (3070), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:36:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 5077 transitions. [2021-11-25 20:36:28,520 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 5077 transitions. Word has length 120 [2021-11-25 20:36:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:36:28,520 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 5077 transitions. [2021-11-25 20:36:28,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 134 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:36:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 5077 transitions. [2021-11-25 20:36:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-25 20:36:28,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:36:28,522 INFO L514 BasicCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1] [2021-11-25 20:36:28,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-25 20:36:28,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-11-25 20:36:28,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2021-11-25 20:36:29,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 20:36:29,148 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:36:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:36:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1563099573, now seen corresponding path program 1 times [2021-11-25 20:36:29,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:36:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854489318] [2021-11-25 20:36:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:36:29,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:36:29,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:36:29,150 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:36:29,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-11-25 20:36:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:36:30,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 20:36:30,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:36:30,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-11-25 20:36:30,350 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 20:36:30,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-11-25 20:36:30,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:36:30,507 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 28 treesize of output 16 [2021-11-25 20:36:32,049 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6398) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:32,430 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6405) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:32,468 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6406) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:32,733 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6411) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:33,036 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6416) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:33,072 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6417) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:36:33,445 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:33,446 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2021-11-25 20:36:33,611 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:33,612 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-11-25 20:36:33,770 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:36:33,770 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-11-25 20:36:33,812 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 19 [2021-11-25 20:36:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2021-11-25 20:36:33,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:36:34,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) (_ bv1 1)))) is different from false [2021-11-25 20:36:34,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6423))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2021-11-25 20:36:34,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6423))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:36:34,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6470))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6423)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:36:34,439 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:36:34,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854489318] [2021-11-25 20:36:34,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854489318] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:36:34,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [460549834] [2021-11-25 20:36:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:36:34,439 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:36:34,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:36:34,440 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:36:34,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-11-25 20:37:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:21,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 20:37:21,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:21,453 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-11-25 20:37:21,617 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 20:37:21,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-25 20:37:21,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:37:21,740 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 28 treesize of output 16 [2021-11-25 20:37:22,256 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6871) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:22,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6881 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6881) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:23,201 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6886) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:23,454 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6890) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:23,500 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6891) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:23,538 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6892)))) is different from true [2021-11-25 20:37:23,575 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6893) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:23,731 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6896 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6896) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:24,287 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse0 (bvneg (bvneg (bvneg v_arrayElimCell_66))))) (and (not (= v_arrayElimCell_68 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_68)))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (_ bv1 1)))))) (exists ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6904) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:24,582 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:24,582 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2021-11-25 20:37:24,695 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:24,696 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-11-25 20:37:24,758 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:24,758 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-11-25 20:37:24,793 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 19 [2021-11-25 20:37:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2021-11-25 20:37:24,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:37:24,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6909))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:37:24,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6909))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:37:25,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6956))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6909)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:37:25,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [460549834] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089739206] [2021-11-25 20:37:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:25,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:37:25,220 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:37:25,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-25 20:37:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:25,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 20:37:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:25,953 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-11-25 20:37:26,082 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:37:26,082 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 16 treesize of output 16 [2021-11-25 20:37:26,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:37:27,821 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:27,821 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 20:37:27,945 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:27,945 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 20:37:28,029 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:28,030 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-11-25 20:37:28,083 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 35 treesize of output 17 [2021-11-25 20:37:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-11-25 20:37:28,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:37:28,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7394))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2021-11-25 20:37:28,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7394))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (_ bv1 1)))) is different from false [2021-11-25 20:37:28,429 INFO L354 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2021-11-25 20:37:28,430 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 72 treesize of output 71 [2021-11-25 20:37:28,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7441))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7394)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6424)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2021-11-25 20:37:28,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089739206] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:28,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:37:28,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 12] total 35 [2021-11-25 20:37:28,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990653810] [2021-11-25 20:37:28,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:37:28,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 20:37:28,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 20:37:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 20:37:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=427, Unknown=48, NotChecked=1650, Total=2256 [2021-11-25 20:37:28,452 INFO L87 Difference]: Start difference. First operand 2938 states and 5077 transitions. Second operand has 36 states, 33 states have (on average 3.787878787878788) internal successors, (125), 35 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 20:37:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:37,846 INFO L93 Difference]: Finished difference Result 5279 states and 9503 transitions. [2021-11-25 20:37:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:37:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.787878787878788) internal successors, (125), 35 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2021-11-25 20:37:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:37,866 INFO L225 Difference]: With dead ends: 5279 [2021-11-25 20:37:37,866 INFO L226 Difference]: Without dead ends: 5279 [2021-11-25 20:37:37,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 227 SyntacticMatches, 125 SemanticMatches, 48 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=140, Invalid=509, Unknown=51, NotChecked=1750, Total=2450 [2021-11-25 20:37:37,868 INFO L933 BasicCegarLoop]: 2909 mSDtfsCounter, 1608 mSDsluCounter, 13834 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 1010 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 16743 SdHoareTripleChecker+Invalid, 63695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57228 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:37,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2109 Valid, 16743 Invalid, 63695 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1010 Valid, 5457 Invalid, 0 Unknown, 57228 Unchecked, 8.9s Time] [2021-11-25 20:37:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2021-11-25 20:37:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 2937. [2021-11-25 20:37:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 1675 states have (on average 1.8322388059701493) internal successors, (3069), 2930 states have internal predecessors, (3069), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2021-11-25 20:37:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 5076 transitions. [2021-11-25 20:37:38,498 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 5076 transitions. Word has length 123 [2021-11-25 20:37:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:38,498 INFO L470 AbstractCegarLoop]: Abstraction has 2937 states and 5076 transitions. [2021-11-25 20:37:38,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.787878787878788) internal successors, (125), 35 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 20:37:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 5076 transitions. [2021-11-25 20:37:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-25 20:37:38,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:38,500 INFO L514 BasicCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1] [2021-11-25 20:37:38,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-25 20:37:38,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-11-25 20:37:38,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2021-11-25 20:37:39,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 20:37:39,116 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 427 more)] === [2021-11-25 20:37:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1563099574, now seen corresponding path program 1 times [2021-11-25 20:37:39,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 20:37:39,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324699371] [2021-11-25 20:37:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:39,118 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 20:37:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 20:37:39,119 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 20:37:39,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-11-25 20:37:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:40,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-25 20:37:40,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:40,279 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-11-25 20:37:40,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:37:40,406 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 17 treesize of output 17 [2021-11-25 20:37:40,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:37:40,431 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-11-25 20:37:40,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:37:40,531 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-11-25 20:37:40,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-25 20:37:40,620 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:37:40,633 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:40,644 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844))) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:40,655 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:40,746 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:40,757 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:40,768 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:40,832 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:37:40,897 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:40,984 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:37:41,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7879)))) is different from true [2021-11-25 20:37:41,084 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7882) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7883) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:37:41,099 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7885) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7884) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,154 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7888))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7889) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:41,168 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7891) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7890) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,183 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7892))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7893) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:41,233 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7897 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7897) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7896 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7896) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,246 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7898) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7899) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,257 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7900))) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7901 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7901) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 20:37:41,268 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7903 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7903) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32))) (exists ((v_ArrVal_7902 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7902) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 20:37:41,538 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7923) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,549 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7925) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7924) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_92) (_ bv44 32)))) is different from true [2021-11-25 20:37:41,590 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:41,591 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:37:41,595 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 22 treesize of output 24 [2021-11-25 20:37:41,689 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:41,689 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:37:41,694 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 22 treesize of output 24 [2021-11-25 20:37:41,783 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:37:41,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 20:37:41,792 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 22 treesize of output 24 [2021-11-25 20:37:41,854 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 31 treesize of output 13 [2021-11-25 20:37:41,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2021-11-25 20:37:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2021-11-25 20:37:41,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:37:42,056 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 20:37:42,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 20:37:42,155 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7926)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7927) .cse0 v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7927) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-11-25 20:37:42,255 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7927) .cse1 v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_7927) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_7926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_7928)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-11-25 20:37:45,044 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8021))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8020) .cse1 v_ArrVal_7927) (select (select (store .cse2 .cse1 v_ArrVal_7926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7928))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8021)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7926))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8020) .cse4 v_ArrVal_7927) .cse5 v_ArrVal_7928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-11-25 20:37:45,064 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 20:37:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324699371] [2021-11-25 20:37:45,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324699371] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1357121019] [2021-11-25 20:37:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:45,065 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 20:37:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 20:37:45,066 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 20:37:45,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ae8c82b-6506-431c-9792-852c06a0f418/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process