./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-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_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/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 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:19:55,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:19:55,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:19:55,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:19:55,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:19:55,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:19:55,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:19:55,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:19:55,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:19:55,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:19:55,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:19:55,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:19:55,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:19:55,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:19:55,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:19:55,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:19:55,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:19:55,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:19:55,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:19:55,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:19:55,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:19:55,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:19:55,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:19:55,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:19:55,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:19:55,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:19:55,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:19:55,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:19:55,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:19:55,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:19:55,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:19:55,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:19:55,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:19:55,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:19:55,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:19:55,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:19:55,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:19:55,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:19:55,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:19:55,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:19:55,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:19:55,416 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 19:19:55,451 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:19:55,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:19:55,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:19:55,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:19:55,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:19:55,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:19:55,453 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:19:55,453 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:19:55,453 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:19:55,453 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:19:55,453 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:19:55,453 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:19:55,454 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:19:55,454 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:19:55,454 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:19:55,454 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:19:55,454 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:19:55,455 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:19:55,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 19:19:55,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 19:19:55,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:19:55,456 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:19:55,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:19:55,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:19:55,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:19:55,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:19:55,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 19:19:55,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 19:19:55,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 19:19:55,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:19:55,458 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 19:19:55,458 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:19:55,458 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:19:55,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:19:55,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:19:55,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:19:55,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:19:55,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:19:55,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:19:55,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:19:55,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:19:55,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:19:55,465 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_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/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 -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2021-11-25 19:19:55,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:19:55,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:19:55,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:19:55,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:19:55,765 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:19:55,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2021-11-25 19:19:55,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/ad8f5a49a/a2bd0e2db0f64571a902c3d6cb6dc0b9/FLAGc684a1a37 [2021-11-25 19:19:56,475 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:19:56,475 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2021-11-25 19:19:56,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/ad8f5a49a/a2bd0e2db0f64571a902c3d6cb6dc0b9/FLAGc684a1a37 [2021-11-25 19:19:56,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/ad8f5a49a/a2bd0e2db0f64571a902c3d6cb6dc0b9 [2021-11-25 19:19:56,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:19:56,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:19:56,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:19:56,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:19:56,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:19:56,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:19:56" (1/1) ... [2021-11-25 19:19:56,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212b6da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:56, skipping insertion in model container [2021-11-25 19:19:56,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:19:56" (1/1) ... [2021-11-25 19:19:56,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:19:56,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:19:57,286 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_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2021-11-25 19:19:57,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:19:57,438 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 19:19:57,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5834ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:19:57, skipping insertion in model container [2021-11-25 19:19:57,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:19:57,439 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-25 19:19:57,442 INFO L158 Benchmark]: Toolchain (without parser) took 736.72ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 79.2MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 19:19:57,444 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:19:57,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.74ms. Allocated memory is still 111.1MB. Free memory was 70.7MB in the beginning and 79.2MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 19:19:57,447 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.21ms. Allocated memory is still 111.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.74ms. Allocated memory is still 111.1MB. Free memory was 70.7MB in the beginning and 79.2MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/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 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:19:59,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:19:59,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:19:59,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:19:59,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:19:59,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:19:59,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:19:59,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:19:59,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:19:59,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:19:59,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:19:59,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:19:59,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:19:59,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:19:59,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:19:59,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:19:59,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:19:59,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:19:59,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:19:59,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:19:59,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:19:59,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:19:59,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:19:59,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:19:59,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:19:59,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:19:59,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:19:59,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:19:59,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:19:59,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:19:59,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:19:59,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:19:59,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:19:59,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:19:59,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:19:59,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:19:59,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:19:59,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:19:59,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:19:59,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:19:59,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:19:59,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-25 19:19:59,783 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:19:59,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:19:59,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:19:59,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:19:59,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:19:59,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:19:59,788 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:19:59,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:19:59,789 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:19:59,789 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:19:59,790 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:19:59,790 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:19:59,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 19:19:59,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 19:19:59,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:19:59,792 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:19:59,793 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:19:59,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:19:59,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:19:59,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:19:59,794 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 19:19:59,794 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 19:19:59,794 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 19:19:59,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:19:59,794 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 19:19:59,795 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 19:19:59,795 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 19:19:59,795 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:19:59,795 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:19:59,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:19:59,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 19:19:59,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:19:59,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:19:59,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:19:59,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:19:59,797 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 19:19:59,798 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 19:19:59,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:19:59,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:19:59,798 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_99ab668a-a1fe-417d-ba72-0a91af87424b/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_99ab668a-a1fe-417d-ba72-0a91af87424b/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 -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2021-11-25 19:20:00,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:20:00,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:20:00,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:20:00,200 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:20:00,201 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:20:00,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2021-11-25 19:20:00,279 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/30e6360a1/53eaed3c1a9445a18e5624a672c8e74e/FLAGecb6ee06a [2021-11-25 19:20:00,871 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:20:00,874 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2021-11-25 19:20:00,903 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/30e6360a1/53eaed3c1a9445a18e5624a672c8e74e/FLAGecb6ee06a [2021-11-25 19:20:01,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/data/30e6360a1/53eaed3c1a9445a18e5624a672c8e74e [2021-11-25 19:20:01,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:20:01,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:20:01,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:20:01,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:20:01,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:20:01,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:01,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a124798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01, skipping insertion in model container [2021-11-25 19:20:01,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:01,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:20:01,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:20:01,619 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_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2021-11-25 19:20:01,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:20:01,707 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-25 19:20:01,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:20:01,735 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_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2021-11-25 19:20:01,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:20:01,789 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:20:01,842 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_99ab668a-a1fe-417d-ba72-0a91af87424b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2021-11-25 19:20:01,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:20:01,952 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:20:01,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01 WrapperNode [2021-11-25 19:20:01,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:20:01,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:20:01,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:20:01,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:20:01,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,094 INFO L137 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 628 [2021-11-25 19:20:02,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:20:02,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:20:02,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:20:02,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:20:02,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:20:02,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:20:02,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:20:02,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:20:02,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (1/1) ... [2021-11-25 19:20:02,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:20:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:20:02,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:20:02,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:20:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-25 19:20:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 19:20:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-25 19:20:02,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-25 19:20:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-25 19:20:02,286 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-25 19:20:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:20:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 19:20:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:20:02,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:20:02,438 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:20:02,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:20:02,443 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 19:20:05,441 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:20:05,474 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:20:05,475 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-11-25 19:20:05,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:20:05 BoogieIcfgContainer [2021-11-25 19:20:05,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:20:05,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:20:05,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:20:05,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:20:05,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:20:01" (1/3) ... [2021-11-25 19:20:05,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a130ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:20:05, skipping insertion in model container [2021-11-25 19:20:05,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:20:01" (2/3) ... [2021-11-25 19:20:05,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a130ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:20:05, skipping insertion in model container [2021-11-25 19:20:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:20:05" (3/3) ... [2021-11-25 19:20:05,491 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2021-11-25 19:20:05,497 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:20:05,497 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2021-11-25 19:20:05,555 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:20:05,565 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 19:20:05,565 INFO L340 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2021-11-25 19:20:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 19:20:05,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:05,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 19:20:05,609 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2021-11-25 19:20:05,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:05,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802825265] [2021-11-25 19:20:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:05,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:05,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:05,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 19:20:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:05,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-25 19:20:05,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:05,789 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 19:20:05,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:05,789 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:05,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802825265] [2021-11-25 19:20:05,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802825265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:05,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:05,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:20:05,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372877713] [2021-11-25 19:20:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:05,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 19:20:05,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 19:20:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:20:05,828 INFO L87 Difference]: Start difference. First operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 19:20:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:05,903 INFO L93 Difference]: Finished difference Result 659 states and 706 transitions. [2021-11-25 19:20:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 19:20:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-11-25 19:20:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:05,937 INFO L225 Difference]: With dead ends: 659 [2021-11-25 19:20:05,937 INFO L226 Difference]: Without dead ends: 657 [2021-11-25 19:20:05,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 19:20:05,946 INFO L933 BasicCegarLoop]: 706 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:05,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:20:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-11-25 19:20:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2021-11-25 19:20:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 320 states have (on average 2.11875) internal successors, (678), 651 states have internal predecessors, (678), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 704 transitions. [2021-11-25 19:20:06,036 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 704 transitions. Word has length 5 [2021-11-25 19:20:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:06,037 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 704 transitions. [2021-11-25 19:20:06,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 19:20:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 704 transitions. [2021-11-25 19:20:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 19:20:06,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:06,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 19:20:06,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:06,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:06,249 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2021-11-25 19:20:06,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:06,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578552450] [2021-11-25 19:20:06,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:06,252 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:06,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:06,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 19:20:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:06,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:20:06,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:06,406 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 19:20:06,434 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 19:20:06,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:06,434 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578552450] [2021-11-25 19:20:06,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578552450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:06,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:06,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:20:06,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987811633] [2021-11-25 19:20:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:06,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:20:06,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:20:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:20:06,439 INFO L87 Difference]: Start difference. First operand 657 states and 704 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 19:20:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:07,724 INFO L93 Difference]: Finished difference Result 615 states and 663 transitions. [2021-11-25 19:20:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:20:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2021-11-25 19:20:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:07,730 INFO L225 Difference]: With dead ends: 615 [2021-11-25 19:20:07,730 INFO L226 Difference]: Without dead ends: 615 [2021-11-25 19:20:07,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:20:07,732 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 596 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:07,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 351 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-25 19:20:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 608. [2021-11-25 19:20:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 320 states have (on average 1.965625) internal successors, (629), 602 states have internal predecessors, (629), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 655 transitions. [2021-11-25 19:20:07,763 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 655 transitions. Word has length 5 [2021-11-25 19:20:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:07,763 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 655 transitions. [2021-11-25 19:20:07,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 19:20:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 655 transitions. [2021-11-25 19:20:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 19:20:07,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:07,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 19:20:07,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-25 19:20:07,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:07,974 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2021-11-25 19:20:07,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:07,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735960522] [2021-11-25 19:20:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:07,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:07,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:07,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-25 19:20:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:08,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:20:08,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:08,083 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 19:20:08,103 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 19:20:08,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:08,104 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:08,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735960522] [2021-11-25 19:20:08,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735960522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:08,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:08,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:20:08,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365209632] [2021-11-25 19:20:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:08,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:20:08,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:20:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:20:08,107 INFO L87 Difference]: Start difference. First operand 608 states and 655 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 19:20:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:09,781 INFO L93 Difference]: Finished difference Result 675 states and 726 transitions. [2021-11-25 19:20:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:20:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2021-11-25 19:20:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:09,786 INFO L225 Difference]: With dead ends: 675 [2021-11-25 19:20:09,786 INFO L226 Difference]: Without dead ends: 675 [2021-11-25 19:20:09,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:20:09,788 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 254 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:09,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 752 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:20:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-11-25 19:20:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 630. [2021-11-25 19:20:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9460227272727273) internal successors, (685), 624 states have internal predecessors, (685), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 711 transitions. [2021-11-25 19:20:09,826 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 711 transitions. Word has length 5 [2021-11-25 19:20:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:09,827 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 711 transitions. [2021-11-25 19:20:09,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 19:20:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 711 transitions. [2021-11-25 19:20:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 19:20:09,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:09,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 19:20:09,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:10,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:10,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1156735106, now seen corresponding path program 1 times [2021-11-25 19:20:10,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:10,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518849663] [2021-11-25 19:20:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:10,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:10,042 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:10,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-25 19:20:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:10,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:20:10,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:10,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 19:20:10,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:10,164 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518849663] [2021-11-25 19:20:10,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518849663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:10,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:10,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:10,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969106055] [2021-11-25 19:20:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:10,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:20:10,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:20:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:20:10,167 INFO L87 Difference]: Start difference. First operand 630 states and 711 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:20:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:10,253 INFO L93 Difference]: Finished difference Result 1211 states and 1353 transitions. [2021-11-25 19:20:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:20:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2021-11-25 19:20:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:10,264 INFO L225 Difference]: With dead ends: 1211 [2021-11-25 19:20:10,264 INFO L226 Difference]: Without dead ends: 1211 [2021-11-25 19:20:10,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:20:10,265 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 569 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:10,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 1505 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:20:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-11-25 19:20:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 631. [2021-11-25 19:20:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 353 states have (on average 1.9433427762039661) internal successors, (686), 625 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 712 transitions. [2021-11-25 19:20:10,292 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 712 transitions. Word has length 6 [2021-11-25 19:20:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:10,292 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 712 transitions. [2021-11-25 19:20:10,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:20:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 712 transitions. [2021-11-25 19:20:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 19:20:10,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:10,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:20:10,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:10,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,504 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2021-11-25 19:20:10,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84404700] [2021-11-25 19:20:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:10,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:10,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:10,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-25 19:20:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:10,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:20:10,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:10,690 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 19:20:10,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:10,691 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84404700] [2021-11-25 19:20:10,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84404700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:10,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:10,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:10,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127437482] [2021-11-25 19:20:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:10,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:20:10,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:20:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:20:10,693 INFO L87 Difference]: Start difference. First operand 631 states and 712 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 19:20:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:10,737 INFO L93 Difference]: Finished difference Result 595 states and 675 transitions. [2021-11-25 19:20:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:20:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-11-25 19:20:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:10,743 INFO L225 Difference]: With dead ends: 595 [2021-11-25 19:20:10,743 INFO L226 Difference]: Without dead ends: 595 [2021-11-25 19:20:10,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 19:20:10,746 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 563 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 627 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 19:20:10,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 627 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:20:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-11-25 19:20:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 589. [2021-11-25 19:20:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 335 states have (on average 1.9194029850746268) internal successors, (643), 583 states have internal predecessors, (643), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 669 transitions. [2021-11-25 19:20:10,766 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 669 transitions. Word has length 11 [2021-11-25 19:20:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:10,767 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 669 transitions. [2021-11-25 19:20:10,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 19:20:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 669 transitions. [2021-11-25 19:20:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 19:20:10,768 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:10,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:20:10,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:10,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,986 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2021-11-25 19:20:10,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:10,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328295813] [2021-11-25 19:20:10,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:10,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:10,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:10,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-25 19:20:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:11,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:20:11,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:11,159 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 19:20:11,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:11,159 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328295813] [2021-11-25 19:20:11,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328295813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:11,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:11,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:20:11,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936540074] [2021-11-25 19:20:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:11,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:11,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:11,161 INFO L87 Difference]: Start difference. First operand 589 states and 669 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 19:20:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:11,243 INFO L93 Difference]: Finished difference Result 574 states and 647 transitions. [2021-11-25 19:20:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:20:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-11-25 19:20:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:11,248 INFO L225 Difference]: With dead ends: 574 [2021-11-25 19:20:11,248 INFO L226 Difference]: Without dead ends: 574 [2021-11-25 19:20:11,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 19:20:11,249 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 534 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1127 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 19:20:11,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1127 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:20:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-25 19:20:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 567. [2021-11-25 19:20:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 327 states have (on average 1.8776758409785932) internal successors, (614), 561 states have internal predecessors, (614), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 640 transitions. [2021-11-25 19:20:11,267 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 640 transitions. Word has length 13 [2021-11-25 19:20:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:11,268 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 640 transitions. [2021-11-25 19:20:11,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 19:20:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 640 transitions. [2021-11-25 19:20:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:11,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:11,269 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] [2021-11-25 19:20:11,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:11,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:11,481 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2021-11-25 19:20:11,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:11,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529065178] [2021-11-25 19:20:11,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:11,482 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:11,483 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:11,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-25 19:20:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:11,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:20:11,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:11,652 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 19:20:11,756 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 19:20:11,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:11,756 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529065178] [2021-11-25 19:20:11,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529065178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:11,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:11,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:11,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512798135] [2021-11-25 19:20:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:11,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:11,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:11,758 INFO L87 Difference]: Start difference. First operand 567 states and 640 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 19:20:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:13,098 INFO L93 Difference]: Finished difference Result 611 states and 705 transitions. [2021-11-25 19:20:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:20:13,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2021-11-25 19:20:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:13,103 INFO L225 Difference]: With dead ends: 611 [2021-11-25 19:20:13,103 INFO L226 Difference]: Without dead ends: 611 [2021-11-25 19:20:13,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 19:20:13,104 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 960 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:13,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 385 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 19:20:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-25 19:20:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 563. [2021-11-25 19:20:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 327 states have (on average 1.8654434250764527) internal successors, (610), 557 states have internal predecessors, (610), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 636 transitions. [2021-11-25 19:20:13,123 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 636 transitions. Word has length 27 [2021-11-25 19:20:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:13,123 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 636 transitions. [2021-11-25 19:20:13,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 19:20:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 636 transitions. [2021-11-25 19:20:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:20:13,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:13,125 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] [2021-11-25 19:20:13,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:13,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:13,336 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2021-11-25 19:20:13,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218874196] [2021-11-25 19:20:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:13,338 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:13,338 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:13,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-25 19:20:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:13,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:20:13,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:13,498 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 19:20:13,743 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 19:20:13,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:13,743 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:13,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218874196] [2021-11-25 19:20:13,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218874196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:13,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:13,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:13,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706387314] [2021-11-25 19:20:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:13,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:13,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:13,747 INFO L87 Difference]: Start difference. First operand 563 states and 636 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 19:20:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:15,734 INFO L93 Difference]: Finished difference Result 645 states and 708 transitions. [2021-11-25 19:20:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:20:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2021-11-25 19:20:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:15,739 INFO L225 Difference]: With dead ends: 645 [2021-11-25 19:20:15,740 INFO L226 Difference]: Without dead ends: 645 [2021-11-25 19:20:15,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 19:20:15,741 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 351 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:15,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 923 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 19:20:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-11-25 19:20:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 559. [2021-11-25 19:20:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 327 states have (on average 1.853211009174312) internal successors, (606), 553 states have internal predecessors, (606), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 632 transitions. [2021-11-25 19:20:15,762 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 632 transitions. Word has length 27 [2021-11-25 19:20:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:15,763 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 632 transitions. [2021-11-25 19:20:15,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 19:20:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 632 transitions. [2021-11-25 19:20:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 19:20:15,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:15,765 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] [2021-11-25 19:20:15,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:15,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:15,981 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2021-11-25 19:20:15,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:15,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744075565] [2021-11-25 19:20:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:15,982 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:15,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:15,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-25 19:20:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:16,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:20:16,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:16,255 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 19:20:16,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:16,255 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744075565] [2021-11-25 19:20:16,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744075565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:16,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:16,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:20:16,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487273893] [2021-11-25 19:20:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:16,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:16,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:16,258 INFO L87 Difference]: Start difference. First operand 559 states and 632 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 19:20:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:16,341 INFO L93 Difference]: Finished difference Result 559 states and 628 transitions. [2021-11-25 19:20:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:20:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2021-11-25 19:20:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:16,346 INFO L225 Difference]: With dead ends: 559 [2021-11-25 19:20:16,346 INFO L226 Difference]: Without dead ends: 559 [2021-11-25 19:20:16,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 19:20:16,349 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 510 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1105 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 19:20:16,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1105 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:20:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-11-25 19:20:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2021-11-25 19:20:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 321 states have (on average 1.8566978193146417) internal successors, (596), 547 states have internal predecessors, (596), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 622 transitions. [2021-11-25 19:20:16,371 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 622 transitions. Word has length 42 [2021-11-25 19:20:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:16,372 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 622 transitions. [2021-11-25 19:20:16,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 19:20:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 622 transitions. [2021-11-25 19:20:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-25 19:20:16,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:16,378 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] [2021-11-25 19:20:16,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:16,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:16,591 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:16,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2021-11-25 19:20:16,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:16,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223440898] [2021-11-25 19:20:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:16,592 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:16,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:16,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-25 19:20:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:16,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:20:16,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:17,116 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 19:20:17,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:17,116 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223440898] [2021-11-25 19:20:17,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223440898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:17,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:17,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:17,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648166278] [2021-11-25 19:20:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:17,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:20:17,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:20:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:20:17,118 INFO L87 Difference]: Start difference. First operand 553 states and 622 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 19:20:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:17,207 INFO L93 Difference]: Finished difference Result 599 states and 668 transitions. [2021-11-25 19:20:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:20:17,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-11-25 19:20:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:17,213 INFO L225 Difference]: With dead ends: 599 [2021-11-25 19:20:17,213 INFO L226 Difference]: Without dead ends: 599 [2021-11-25 19:20:17,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 19:20:17,214 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:17,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1012 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:20:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-25 19:20:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-25 19:20:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 367 states have (on average 1.7493188010899183) internal successors, (642), 593 states have internal predecessors, (642), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 668 transitions. [2021-11-25 19:20:17,236 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 668 transitions. Word has length 50 [2021-11-25 19:20:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:17,237 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 668 transitions. [2021-11-25 19:20:17,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 19:20:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 668 transitions. [2021-11-25 19:20:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-25 19:20:17,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:17,242 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] [2021-11-25 19:20:17,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:17,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:17,455 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2021-11-25 19:20:17,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:17,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863609041] [2021-11-25 19:20:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:17,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:17,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:17,458 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:17,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-25 19:20:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:17,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 19:20:17,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:17,852 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 19:20:17,862 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 19:20:18,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:20:18,464 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 19:20:18,475 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:20:18,475 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 19:20:18,496 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 19:20:18,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:18,497 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863609041] [2021-11-25 19:20:18,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863609041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:18,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:18,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:20:18,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890613108] [2021-11-25 19:20:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:18,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:18,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:18,499 INFO L87 Difference]: Start difference. First operand 599 states and 668 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 19:20:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:19,716 INFO L93 Difference]: Finished difference Result 568 states and 638 transitions. [2021-11-25 19:20:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:20:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-25 19:20:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:19,721 INFO L225 Difference]: With dead ends: 568 [2021-11-25 19:20:19,721 INFO L226 Difference]: Without dead ends: 568 [2021-11-25 19:20:19,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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 19:20:19,722 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 827 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:19,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 260 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 19:20:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-25 19:20:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 529. [2021-11-25 19:20:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6059701492537313) internal successors, (538), 523 states have internal predecessors, (538), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2021-11-25 19:20:19,737 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 53 [2021-11-25 19:20:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:19,737 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2021-11-25 19:20:19,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 19:20:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2021-11-25 19:20:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-25 19:20:19,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:19,739 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] [2021-11-25 19:20:19,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:19,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:19,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2021-11-25 19:20:19,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926687293] [2021-11-25 19:20:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:19,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:19,956 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:20,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-25 19:20:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:20,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:20:20,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:20,311 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 19:20:20,335 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 19:20:20,372 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 19:20:20,383 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 19:20:20,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:20,384 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926687293] [2021-11-25 19:20:20,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926687293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:20,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:20,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:20:20,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914096269] [2021-11-25 19:20:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:20,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:20:20,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:20:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:20:20,385 INFO L87 Difference]: Start difference. First operand 529 states and 564 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 19:20:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:21,935 INFO L93 Difference]: Finished difference Result 528 states and 563 transitions. [2021-11-25 19:20:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:20:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2021-11-25 19:20:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:21,939 INFO L225 Difference]: With dead ends: 528 [2021-11-25 19:20:21,939 INFO L226 Difference]: Without dead ends: 528 [2021-11-25 19:20:21,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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 19:20:21,940 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 4 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:21,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1325 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 19:20:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-25 19:20:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-11-25 19:20:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 522 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 563 transitions. [2021-11-25 19:20:21,956 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 563 transitions. Word has length 58 [2021-11-25 19:20:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:21,957 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 563 transitions. [2021-11-25 19:20:21,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 19:20:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 563 transitions. [2021-11-25 19:20:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-25 19:20:21,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:21,958 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] [2021-11-25 19:20:21,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:22,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:22,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2021-11-25 19:20:22,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093000718] [2021-11-25 19:20:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:22,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:22,174 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:22,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-25 19:20:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:22,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:20:22,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:22,473 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 19:20:22,497 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 19:20:22,506 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 19:20:22,563 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 19:20:22,567 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 19:20:22,585 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 19:20:22,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:22,586 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:22,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093000718] [2021-11-25 19:20:22,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093000718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:22,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:22,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:20:22,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087484788] [2021-11-25 19:20:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:22,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:20:22,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:22,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:20:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:20:22,588 INFO L87 Difference]: Start difference. First operand 528 states and 563 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 19:20:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:24,204 INFO L93 Difference]: Finished difference Result 527 states and 562 transitions. [2021-11-25 19:20:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:20:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2021-11-25 19:20:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:24,208 INFO L225 Difference]: With dead ends: 527 [2021-11-25 19:20:24,208 INFO L226 Difference]: Without dead ends: 527 [2021-11-25 19:20:24,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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 19:20:24,209 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:24,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1335 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:20:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-11-25 19:20:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2021-11-25 19:20:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 521 states have internal predecessors, (536), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 19:20:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 562 transitions. [2021-11-25 19:20:24,223 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 562 transitions. Word has length 58 [2021-11-25 19:20:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:24,223 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 562 transitions. [2021-11-25 19:20:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 19:20:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 562 transitions. [2021-11-25 19:20:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 19:20:24,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:24,225 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] [2021-11-25 19:20:24,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:24,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:24,437 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash -624458498, now seen corresponding path program 1 times [2021-11-25 19:20:24,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:24,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435864817] [2021-11-25 19:20:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:24,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:24,440 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:24,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-25 19:20:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:24,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:20:24,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:24,754 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 19:20:24,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:20:24,755 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:24,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435864817] [2021-11-25 19:20:24,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435864817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:20:24,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:20:24,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:20:24,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207699782] [2021-11-25 19:20:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:20:24,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:20:24,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:20:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:20:24,757 INFO L87 Difference]: Start difference. First operand 527 states and 562 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 19:20:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:24,801 INFO L93 Difference]: Finished difference Result 530 states and 566 transitions. [2021-11-25 19:20:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:20:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2021-11-25 19:20:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:24,805 INFO L225 Difference]: With dead ends: 530 [2021-11-25 19:20:24,805 INFO L226 Difference]: Without dead ends: 530 [2021-11-25 19:20:24,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 19:20:24,806 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1531 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 19:20:24,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1531 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:20:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-25 19:20:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-11-25 19:20:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 336 states have (on average 1.6041666666666667) internal successors, (539), 524 states have internal predecessors, (539), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:20:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 566 transitions. [2021-11-25 19:20:24,821 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 566 transitions. Word has length 66 [2021-11-25 19:20:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:24,821 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 566 transitions. [2021-11-25 19:20:24,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 19:20:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 566 transitions. [2021-11-25 19:20:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:20:24,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:24,822 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] [2021-11-25 19:20:24,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:25,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:25,037 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash -594716233, now seen corresponding path program 1 times [2021-11-25 19:20:25,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:25,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693695377] [2021-11-25 19:20:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:25,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:25,040 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:25,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-25 19:20:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:25,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:20:25,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:25,388 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 19:20:25,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:25,546 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 19:20:25,547 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:25,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693695377] [2021-11-25 19:20:25,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693695377] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:25,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275185946] [2021-11-25 19:20:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:25,548 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:20:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:20:25,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:20:25,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-11-25 19:20:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:25,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:20:25,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:26,083 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 19:20:26,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:26,196 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 19:20:26,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1275185946] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:26,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116303345] [2021-11-25 19:20:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:26,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:20:26,218 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:20:26,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:20:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:26,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:20:26,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:26,520 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 19:20:26,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:26,635 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 19:20:26,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116303345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:26,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:20:26,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2021-11-25 19:20:26,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371491288] [2021-11-25 19:20:26,636 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:20:26,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:20:26,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:20:26,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:20:26,638 INFO L87 Difference]: Start difference. First operand 530 states and 566 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 19:20:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:26,824 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2021-11-25 19:20:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 19:20:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 67 [2021-11-25 19:20:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:26,829 INFO L225 Difference]: With dead ends: 542 [2021-11-25 19:20:26,829 INFO L226 Difference]: Without dead ends: 542 [2021-11-25 19:20:26,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 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 19:20:26,830 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 23 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:26,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1535 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:20:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-25 19:20:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2021-11-25 19:20:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 345 states have (on average 1.6057971014492753) internal successors, (554), 533 states have internal predecessors, (554), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:20:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 581 transitions. [2021-11-25 19:20:26,847 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 581 transitions. Word has length 67 [2021-11-25 19:20:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:26,848 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 581 transitions. [2021-11-25 19:20:26,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 19:20:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 581 transitions. [2021-11-25 19:20:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 19:20:26,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:26,849 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] [2021-11-25 19:20:26,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:27,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:27,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:27,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:20:27,463 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 133393214, now seen corresponding path program 2 times [2021-11-25 19:20:27,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800282472] [2021-11-25 19:20:27,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:20:27,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:27,465 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:27,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-25 19:20:27,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:20:27,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:20:27,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:27,983 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 19:20:27,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:28,247 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 19:20:28,247 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:28,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800282472] [2021-11-25 19:20:28,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800282472] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:28,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [827097261] [2021-11-25 19:20:28,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:20:28,248 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:20:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:20:28,249 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:20:28,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-11-25 19:20:29,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:20:29,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:29,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 19:20:29,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:29,306 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 19:20:29,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:29,476 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 19:20:29,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [827097261] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:29,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849476446] [2021-11-25 19:20:29,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:20:29,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:20:29,478 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:20:29,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:20:41,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:20:41,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:20:41,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:41,547 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 19:20:41,701 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:20:41,702 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 19:20:41,733 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 19:20:42,125 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:20:42,125 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 19:20:42,205 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 19:20:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:20:42,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:42,401 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-11-25 19:20:42,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-11-25 19:20:42,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1262) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2021-11-25 19:20:42,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849476446] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:20:42,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 19:20:42,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2021-11-25 19:20:42,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784734715] [2021-11-25 19:20:42,418 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 19:20:42,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 19:20:42,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 19:20:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=467, Unknown=2, NotChecked=44, Total=600 [2021-11-25 19:20:42,419 INFO L87 Difference]: Start difference. First operand 540 states and 581 transitions. Second operand has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 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 19:20:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:47,941 INFO L93 Difference]: Finished difference Result 609 states and 663 transitions. [2021-11-25 19:20:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:20:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 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 70 [2021-11-25 19:20:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:47,946 INFO L225 Difference]: With dead ends: 609 [2021-11-25 19:20:47,946 INFO L226 Difference]: Without dead ends: 605 [2021-11-25 19:20:47,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 322 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=305, Invalid=1743, Unknown=26, NotChecked=88, Total=2162 [2021-11-25 19:20:47,948 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 436 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:47,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 3519 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2927 Invalid, 0 Unknown, 308 Unchecked, 4.7s Time] [2021-11-25 19:20:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-25 19:20:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 544. [2021-11-25 19:20:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 350 states have (on average 1.5942857142857143) internal successors, (558), 537 states have internal predecessors, (558), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:20:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 585 transitions. [2021-11-25 19:20:47,963 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 585 transitions. Word has length 70 [2021-11-25 19:20:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:47,964 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 585 transitions. [2021-11-25 19:20:47,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 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 19:20:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 585 transitions. [2021-11-25 19:20:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-25 19:20:47,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:47,965 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] [2021-11-25 19:20:47,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:48,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:48,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:48,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:20:48,570 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1838662344, now seen corresponding path program 1 times [2021-11-25 19:20:48,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671902490] [2021-11-25 19:20:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:48,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:48,572 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:48,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-25 19:20:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:48,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:20:48,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:49,061 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 19:20:49,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:49,690 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 19:20:49,690 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671902490] [2021-11-25 19:20:49,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671902490] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1433904527] [2021-11-25 19:20:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:49,691 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:20:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:20:49,693 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:20:49,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-11-25 19:20:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:50,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 19:20:50,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:50,244 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 19:20:50,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:50,452 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 19:20:50,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1433904527] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:50,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023861530] [2021-11-25 19:20:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:20:50,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:20:50,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:20:50,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 19:20:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:20:50,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:20:50,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:50,911 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 19:20:50,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:51,707 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 19:20:51,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023861530] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:51,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:20:51,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2021-11-25 19:20:51,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369683905] [2021-11-25 19:20:51,708 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:20:51,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 19:20:51,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:20:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 19:20:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:20:51,709 INFO L87 Difference]: Start difference. First operand 544 states and 585 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 19:20:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:20:54,191 INFO L93 Difference]: Finished difference Result 585 states and 642 transitions. [2021-11-25 19:20:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 19:20:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 75 [2021-11-25 19:20:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:20:54,196 INFO L225 Difference]: With dead ends: 585 [2021-11-25 19:20:54,196 INFO L226 Difference]: Without dead ends: 579 [2021-11-25 19:20:54,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 19:20:54,198 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 150 mSDsluCounter, 5678 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:20:54,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 6197 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:20:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-11-25 19:20:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 563. [2021-11-25 19:20:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 369 states have (on average 1.5826558265582655) internal successors, (584), 556 states have internal predecessors, (584), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:20:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 611 transitions. [2021-11-25 19:20:54,215 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 611 transitions. Word has length 75 [2021-11-25 19:20:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:20:54,215 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 611 transitions. [2021-11-25 19:20:54,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 19:20:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 611 transitions. [2021-11-25 19:20:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-25 19:20:54,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:20:54,217 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] [2021-11-25 19:20:54,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-11-25 19:20:54,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2021-11-25 19:20:54,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:20:54,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:20:54,831 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:20:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:20:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 262128703, now seen corresponding path program 2 times [2021-11-25 19:20:54,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:20:54,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320015118] [2021-11-25 19:20:54,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:20:54,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:20:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:20:54,834 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:20:54,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-25 19:20:55,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:20:55,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:55,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 19:20:55,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:20:56,011 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 19:20:56,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:20:58,601 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 19:20:58,601 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:20:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320015118] [2021-11-25 19:20:58,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320015118] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:20:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [702248343] [2021-11-25 19:20:58,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:20:58,602 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:20:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:20:58,614 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:20:58,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-11-25 19:20:59,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:20:59,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:20:59,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 19:20:59,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:21:00,268 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 19:21:00,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:21:01,171 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 19:21:01,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [702248343] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:21:01,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468499285] [2021-11-25 19:21:01,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:21:01,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:21:01,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:21:01,173 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:21:01,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 19:21:16,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 19:21:16,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:21:16,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:21:16,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:21:16,321 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 19:21:16,549 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:21:16,549 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 14 treesize of output 14 [2021-11-25 19:21:16,592 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 19:21:16,716 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 19:21:16,725 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 19:21:17,073 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 19:21:17,077 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 19:21:17,334 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:17,350 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:17,367 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325)))) is different from true [2021-11-25 19:21:17,383 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:17,400 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:21:17,708 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335)))) is different from true [2021-11-25 19:21:17,988 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:18,235 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:18,796 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2357) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:21:18,854 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:21:18,855 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 19:21:18,860 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 19:21:19,003 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 19:21:19,006 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 19:21:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 144 not checked. [2021-11-25 19:21:19,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:21:19,939 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2401) |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 (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2401) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2402) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 19:21:19,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468499285] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:21:19,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 19:21:19,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 17] total 62 [2021-11-25 19:21:19,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933086652] [2021-11-25 19:21:19,946 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 19:21:19,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-25 19:21:19,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:21:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-25 19:21:19,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2365, Unknown=30, NotChecked=1150, Total=4160 [2021-11-25 19:21:19,950 INFO L87 Difference]: Start difference. First operand 563 states and 611 transitions. Second operand has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 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 19:21:43,431 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335))) (exists ((v_ArrVal_2357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:21:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:21:57,228 INFO L93 Difference]: Finished difference Result 647 states and 733 transitions. [2021-11-25 19:21:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-25 19:21:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 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 86 [2021-11-25 19:21:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:21:57,233 INFO L225 Difference]: With dead ends: 647 [2021-11-25 19:21:57,233 INFO L226 Difference]: Without dead ends: 637 [2021-11-25 19:21:57,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 347 SyntacticMatches, 21 SemanticMatches, 135 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2886 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=2684, Invalid=12545, Unknown=565, NotChecked=2838, Total=18632 [2021-11-25 19:21:57,240 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 720 mSDsluCounter, 7275 mSDsCounter, 0 mSdLazyCounter, 8453 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 7572 SdHoareTripleChecker+Invalid, 14932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 8453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6404 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:21:57,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 7572 Invalid, 14932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 8453 Invalid, 0 Unknown, 6404 Unchecked, 12.9s Time] [2021-11-25 19:21:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-11-25 19:21:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 594. [2021-11-25 19:21:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 401 states have (on average 1.5486284289276808) internal successors, (621), 587 states have internal predecessors, (621), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:21:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 648 transitions. [2021-11-25 19:21:57,260 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 648 transitions. Word has length 86 [2021-11-25 19:21:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:21:57,261 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 648 transitions. [2021-11-25 19:21:57,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 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 19:21:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 648 transitions. [2021-11-25 19:21:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-25 19:21:57,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:21:57,263 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] [2021-11-25 19:21:57,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:21:57,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-25 19:21:57,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:21:57,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:21:57,869 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:21:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:21:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2021-11-25 19:21:57,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:21:57,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324526530] [2021-11-25 19:21:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:21:57,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:21:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:21:57,871 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:21:57,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-25 19:21:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:21:58,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:21:58,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:21:59,405 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 19:21:59,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:22:04,231 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 19:22:04,232 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:22:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324526530] [2021-11-25 19:22:04,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324526530] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:22:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [990487170] [2021-11-25 19:22:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:04,233 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:22:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:22:04,234 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:22:04,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-11-25 19:22:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:05,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:22:05,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:22:05,393 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 19:22:05,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:22:06,472 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 19:22:06,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [990487170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:22:06,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537218542] [2021-11-25 19:22:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:22:06,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:22:06,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:22:06,473 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:22:06,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 19:22:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:22:06,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:22:06,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:22:07,213 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 19:22:07,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:22:15,716 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 19:22:15,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537218542] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:22:15,716 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:22:15,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2021-11-25 19:22:15,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569730751] [2021-11-25 19:22:15,717 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:22:15,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2021-11-25 19:22:15,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:22:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2021-11-25 19:22:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2021-11-25 19:22:15,725 INFO L87 Difference]: Start difference. First operand 594 states and 648 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 19:24:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:48,388 INFO L93 Difference]: Finished difference Result 740 states and 855 transitions. [2021-11-25 19:24:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2021-11-25 19:24:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 110 [2021-11-25 19:24:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:48,394 INFO L225 Difference]: With dead ends: 740 [2021-11-25 19:24:48,394 INFO L226 Difference]: Without dead ends: 734 [2021-11-25 19:24:48,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7405 ImplicationChecksByTransitivity, 151.2s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2021-11-25 19:24:48,435 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 1065 mSDsluCounter, 24941 mSDsCounter, 0 mSdLazyCounter, 7104 mSolverCounterSat, 1441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 25489 SdHoareTripleChecker+Invalid, 8545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 7104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:48,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 25489 Invalid, 8545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1441 Valid, 7104 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2021-11-25 19:24:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-11-25 19:24:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 658. [2021-11-25 19:24:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 465 states have (on average 1.5182795698924731) internal successors, (706), 651 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:24:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 733 transitions. [2021-11-25 19:24:48,459 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 733 transitions. Word has length 110 [2021-11-25 19:24:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:48,459 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 733 transitions. [2021-11-25 19:24:48,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 19:24:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 733 transitions. [2021-11-25 19:24:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-25 19:24:48,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:48,462 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] [2021-11-25 19:24:48,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-11-25 19:24:48,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 19:24:48,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-25 19:24:49,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:24:49,070 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:24:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -207004553, now seen corresponding path program 2 times [2021-11-25 19:24:49,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:24:49,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500291062] [2021-11-25 19:24:49,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:24:49,074 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:24:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:24:49,075 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:24:49,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-25 19:24:49,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:24:49,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:24:49,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 19:24:49,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:24:49,980 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 19:24:49,981 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 31 [2021-11-25 19:24:50,059 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 19:24:50,060 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 34 treesize of output 19 [2021-11-25 19:24:50,088 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 19:24:50,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:24:50,089 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:24:50,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500291062] [2021-11-25 19:24:50,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500291062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:24:50,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:24:50,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:24:50,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877077178] [2021-11-25 19:24:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:24:50,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:24:50,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:24:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:24:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:24:50,091 INFO L87 Difference]: Start difference. First operand 658 states and 733 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 19:24:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:24:51,998 INFO L93 Difference]: Finished difference Result 949 states and 1038 transitions. [2021-11-25 19:24:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:24:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 113 [2021-11-25 19:24:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:24:52,006 INFO L225 Difference]: With dead ends: 949 [2021-11-25 19:24:52,006 INFO L226 Difference]: Without dead ends: 949 [2021-11-25 19:24:52,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:24:52,008 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 346 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:24:52,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1636 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 599 Invalid, 0 Unknown, 212 Unchecked, 1.8s Time] [2021-11-25 19:24:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-11-25 19:24:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 657. [2021-11-25 19:24:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 465 states have (on average 1.5161290322580645) internal successors, (705), 650 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:24:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 732 transitions. [2021-11-25 19:24:52,030 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 732 transitions. Word has length 113 [2021-11-25 19:24:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:24:52,030 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 732 transitions. [2021-11-25 19:24:52,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 19:24:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 732 transitions. [2021-11-25 19:24:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-25 19:24:52,032 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:24:52,033 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] [2021-11-25 19:24:52,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-11-25 19:24:52,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:24:52,247 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:24:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:24:52,247 INFO L85 PathProgramCache]: Analyzing trace with hash -207004552, now seen corresponding path program 1 times [2021-11-25 19:24:52,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:24:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343016337] [2021-11-25 19:24:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:52,248 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:24:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:24:52,249 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:24:52,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-25 19:24:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:24:53,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 19:24:53,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:24:53,362 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 19:24:53,498 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 19:24:53,515 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:24:53,515 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 19:24:53,548 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 19:24:53,560 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 19:24:53,687 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 19:24:53,692 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 19:24:53,815 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:53,831 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:53,846 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:53,866 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:53,883 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:24:53,898 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:53,949 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:24:54,050 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:24:54,102 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,123 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,143 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,163 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:24:54,306 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2021-11-25 19:24:54,372 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2021-11-25 19:24:54,386 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,404 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,475 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2021-11-25 19:24:54,490 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,505 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,520 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,537 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,588 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214)))) is different from true [2021-11-25 19:24:54,605 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,620 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:24:54,634 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,649 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2021-11-25 19:24:54,683 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,703 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:24:54,722 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,743 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,809 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:24:54,877 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:24:54,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, 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 19:24:54,885 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 19:24:55,023 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:24:55,024 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 19:24:55,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, 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 19:24:55,066 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 19:24:55,069 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 19:24:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2021-11-25 19:24:55,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:24:55,321 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (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~mem35#1.base| v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 19:24:55,386 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4236 (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_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (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_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:24:56,397 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4328)) (.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~mem33#1.base| v_ArrVal_4329) .cse0 v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (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~mem33#1.base| v_ArrVal_4329) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4236) |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 19:24:56,407 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:24:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343016337] [2021-11-25 19:24:56,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343016337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:24:56,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526293791] [2021-11-25 19:24:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:24:56,408 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:24:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:24:56,414 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:24:56,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-11-25 19:27:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:07,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-25 19:27:07,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:27:08,007 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 19:27:08,138 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 19:27:08,150 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:27:08,151 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 14 treesize of output 14 [2021-11-25 19:27:08,171 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 19:27:08,180 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 19:27:08,239 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 19:27:08,243 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 19:27:08,320 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2021-11-25 19:27:08,332 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,344 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_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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,357 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4703)))) is different from true [2021-11-25 19:27:08,369 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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 19:27:08,381 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_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,393 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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|))) is different from true [2021-11-25 19:27:08,405 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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:08,442 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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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 19:27:08,453 WARN L860 $PredicateComparison]: unable to prove that (and (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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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)))) is different from true [2021-11-25 19:27:08,466 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_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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,479 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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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|))) is different from true [2021-11-25 19:27:08,491 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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)))) is different from true [2021-11-25 19:27:08,504 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_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,520 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,547 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,564 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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728)))) is different from true [2021-11-25 19:27:08,580 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,596 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732)))) is different from true [2021-11-25 19:27:08,612 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:08,628 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_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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,644 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,660 WARN L860 $PredicateComparison]: unable to prove that (and (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_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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,717 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:08,734 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_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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,750 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_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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,767 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ 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 19:27:08,784 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752) |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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,801 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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|))) is different from true [2021-11-25 19:27:08,818 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_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_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,835 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:08,851 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_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:08,867 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763)))) is different from true [2021-11-25 19:27:08,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764)))) is different from true [2021-11-25 19:27:08,903 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,923 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,942 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:08,962 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:08,982 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:09,002 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:09,022 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778)))) is different from true [2021-11-25 19:27:09,042 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:09,111 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:09,112 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 19:27:09,120 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 19:27:09,250 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:09,250 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 19:27:09,262 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 19:27:09,310 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 19:27:09,315 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 19:27:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2021-11-25 19:27:09,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:27:09,404 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (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~mem35#1.base| v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4782) |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 19:27:09,448 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4782 (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_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (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_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:27:10,294 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (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~mem33#1.base| v_ArrVal_4874) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4875)) (.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~mem33#1.base| v_ArrVal_4874) .cse2 v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 19:27:10,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1526293791] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:27:10,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629643177] [2021-11-25 19:27:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:10,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:27:10,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:27:10,304 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:27:10,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 19:27:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:10,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 19:27:10,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:27:10,833 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 19:27:10,944 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 19:27:10,956 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:27:10,956 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 19:27:10,966 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 19:27:10,973 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 19:27:11,044 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 19:27:11,048 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 19:27:11,115 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240)))) is different from true [2021-11-25 19:27:11,126 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5242) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,137 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,152 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,165 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5249) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,176 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250)))) is different from true [2021-11-25 19:27:11,194 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,206 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,217 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257)))) is different from true [2021-11-25 19:27:11,229 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258)))) is different from true [2021-11-25 19:27:11,240 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:11,277 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264)))) is different from true [2021-11-25 19:27:11,288 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:11,326 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,337 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2021-11-25 19:27:11,349 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,362 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,401 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:11,423 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,435 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,458 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,473 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,524 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:11,540 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,557 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:11,573 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,624 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,668 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306)))) is different from true [2021-11-25 19:27:11,680 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,761 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,791 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,807 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,822 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 19:27:11,837 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2021-11-25 19:27:11,848 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:11,860 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327)))) is different from true [2021-11-25 19:27:11,906 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:11,907 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 19:27:11,911 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 19:27:11,978 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:11,978 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 19:27:11,983 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 19:27:12,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, 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 19:27:12,016 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 19:27:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2021-11-25 19:27:12,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:27:12,087 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#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 (_ 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 ((.cse1 (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~mem35#1.base| v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 19:27:12,118 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 19:27:12,784 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~mem33#1.base| v_ArrVal_5421) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5420) |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~mem33#1.base| v_ArrVal_5420)) (.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~mem33#1.base| v_ArrVal_5421) .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 19:27:12,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629643177] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:27:12,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:27:12,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 51, 45] total 119 [2021-11-25 19:27:12,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415558029] [2021-11-25 19:27:12,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:27:12,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2021-11-25 19:27:12,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:27:12,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2021-11-25 19:27:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=217, Unknown=126, NotChecked=16422, Total=17030 [2021-11-25 19:27:12,806 INFO L87 Difference]: Start difference. First operand 657 states and 732 transitions. Second operand has 120 states, 118 states have (on average 1.6864406779661016) internal successors, (199), 120 states have internal predecessors, (199), 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 19:27:13,264 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 19:27:13,270 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5242) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:13,280 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (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_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (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_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5245) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:13,292 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (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_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (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_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165) |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_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.base|)) (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$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (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_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295) |c_#memory_$Pointer$.base|)) (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_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:13,416 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:27:18,178 INFO L93 Difference]: Finished difference Result 663 states and 739 transitions. [2021-11-25 19:27:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:27:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 120 states, 118 states have (on average 1.6864406779661016) internal successors, (199), 120 states have internal predecessors, (199), 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 113 [2021-11-25 19:27:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:27:18,196 INFO L225 Difference]: With dead ends: 663 [2021-11-25 19:27:18,196 INFO L226 Difference]: Without dead ends: 663 [2021-11-25 19:27:18,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 200 SyntacticMatches, 30 SemanticMatches, 141 ConstructedPredicates, 124 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=320, Invalid=380, Unknown=138, NotChecked=19468, Total=20306 [2021-11-25 19:27:18,208 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 407 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 58763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56822 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:27:18,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 1333 Invalid, 58763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1930 Invalid, 0 Unknown, 56822 Unchecked, 4.8s Time] [2021-11-25 19:27:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-11-25 19:27:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 656. [2021-11-25 19:27:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 465 states have (on average 1.5139784946236559) internal successors, (704), 649 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 19:27:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 731 transitions. [2021-11-25 19:27:18,239 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 731 transitions. Word has length 113 [2021-11-25 19:27:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:27:18,239 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 731 transitions. [2021-11-25 19:27:18,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 118 states have (on average 1.6864406779661016) internal successors, (199), 120 states have internal predecessors, (199), 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 19:27:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 731 transitions. [2021-11-25 19:27:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-25 19:27:18,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:27:18,242 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] [2021-11-25 19:27:18,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-25 19:27:18,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-11-25 19:27:18,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2021-11-25 19:27:18,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:27:18,863 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 19:27:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:27:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 700677701, now seen corresponding path program 1 times [2021-11-25 19:27:18,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:27:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60535839] [2021-11-25 19:27:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:18,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:27:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:27:18,865 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:27:18,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-11-25 19:27:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:19,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 19:27:20,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:27:20,009 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 19:27:20,167 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 19:27:20,167 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 19:27:20,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, 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 19:27:20,376 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 19:27:23,550 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:23,551 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 19:27:23,706 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:23,707 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 19:27:23,848 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:27:23,848 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 19:27:23,906 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 19:27:23,990 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 19:27:23,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:27:24,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (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_5844) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))))) is different from false [2021-11-25 19:27:24,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5843))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2021-11-25 19:27:24,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (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_5843))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (_ bv1 1)))) is different from false [2021-11-25 19:27:24,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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~mem33#1.base| v_ArrVal_5890))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5843)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2021-11-25 19:27:24,570 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:27:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60535839] [2021-11-25 19:27:24,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60535839] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:27:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756544724] [2021-11-25 19:27:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:27:24,571 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:27:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:27:24,578 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:27:24,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99ab668a-a1fe-417d-ba72-0a91af87424b/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-11-25 19:27:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:27:53,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 19:27:53,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:27:53,533 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-25 19:27:53,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-25 19:27:54,487 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-25 19:27:54,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 50 [2021-11-25 19:27:54,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 19:27:54,687 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 19:27:55,069 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 47 treesize of output 23 [2021-11-25 19:27:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-25 19:27:55,864 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271))) (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:27:56,135 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:56,208 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 19:27:56,492 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:27:57,786 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6284))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:27:58,384 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6288)))) is different from true [2021-11-25 19:27:58,671 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6290))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:27:59,043 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6293)))) is different from true [2021-11-25 19:28:00,372 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6303) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:28:00,824 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6307) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:28:01,268 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6311) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 19:28:01,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 19:28:02,303 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:28:02,303 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 44 treesize of output 49 [2021-11-25 19:28:02,323 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-25 19:28:02,323 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 37 treesize of output 29 [2021-11-25 19:28:02,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 19:28:02,441 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 19:28:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:28:02,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:28:02,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:28:02,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:28:02,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, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2021-11-25 19:28:02,759 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 21 treesize of output 13 [2021-11-25 19:28:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 429 not checked. [2021-11-25 19:28:02,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:28:04,344 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:28:04,345 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1704 treesize of output 1538 [2021-11-25 19:28:04,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 383012 treesize of output 316232 [2021-11-25 19:28:05,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 327647 treesize of output 327543 [2021-11-25 19:28:35,383 WARN L227 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 455 DAG size of output: 455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 19:28:44,327 WARN L227 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 455 DAG size of output: 455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)