./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI --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 e2d96ac7da90505ebe789a14ca36a5b916234d7d0d8ab11cf581076a8deb0195 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:55:16,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:55:16,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:55:17,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:55:17,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:55:17,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:55:17,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:55:17,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:55:17,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:55:17,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:55:17,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:55:17,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:55:17,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:55:17,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:55:17,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:55:17,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:55:17,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:55:17,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:55:17,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:55:17,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:55:17,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:55:17,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:55:17,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:55:17,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:55:17,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:55:17,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:55:17,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:55:17,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:55:17,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:55:17,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:55:17,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:55:17,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:55:17,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:55:17,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:55:17,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:55:17,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:55:17,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:55:17,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:55:17,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:55:17,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:55:17,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:55:17,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 03:55:17,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:55:17,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:55:17,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:55:17,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:55:17,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:55:17,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:55:17,108 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:55:17,109 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:55:17,109 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:55:17,109 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:55:17,110 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:55:17,110 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:55:17,110 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:55:17,111 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:55:17,111 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:55:17,111 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:55:17,111 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:55:17,112 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:55:17,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:55:17,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:55:17,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:55:17,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:55:17,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:55:17,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:55:17,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:55:17,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:55:17,114 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:55:17,114 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:55:17,114 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:55:17,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:55:17,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:55:17,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:55:17,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:55:17,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:55:17,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:55:17,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:17,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:55:17,116 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:55:17,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:55:17,117 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:55:17,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:55:17,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:55:17,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/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_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI 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 -> e2d96ac7da90505ebe789a14ca36a5b916234d7d0d8ab11cf581076a8deb0195 [2022-11-03 03:55:17,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:55:17,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:55:17,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:55:17,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:55:17,490 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:55:17,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i [2022-11-03 03:55:17,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/1c5723621/6815c2a1a8c246d0a4e0fc2a25a3c0dd/FLAG5b50c6b28 [2022-11-03 03:55:18,280 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:55:18,281 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i [2022-11-03 03:55:18,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/1c5723621/6815c2a1a8c246d0a4e0fc2a25a3c0dd/FLAG5b50c6b28 [2022-11-03 03:55:18,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/1c5723621/6815c2a1a8c246d0a4e0fc2a25a3c0dd [2022-11-03 03:55:18,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:55:18,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:55:18,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:18,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:55:18,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:55:18,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:18" (1/1) ... [2022-11-03 03:55:18,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76883aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:18, skipping insertion in model container [2022-11-03 03:55:18,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:18" (1/1) ... [2022-11-03 03:55:18,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:55:18,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:19,158 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_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i[33022,33035] [2022-11-03 03:55:19,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:19,382 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-03 03:55:19,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@514d13db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19, skipping insertion in model container [2022-11-03 03:55:19,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:19,383 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 03:55:19,385 INFO L158 Benchmark]: Toolchain (without parser) took 922.04ms. Allocated memory is still 100.7MB. Free memory was 57.6MB in the beginning and 55.9MB in the end (delta: 1.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-11-03 03:55:19,386 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:55:19,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 919.03ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 55.9MB in the end (delta: 1.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-11-03 03:55:19,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 919.03ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 55.9MB in the end (delta: 1.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes 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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI --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 e2d96ac7da90505ebe789a14ca36a5b916234d7d0d8ab11cf581076a8deb0195 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:55:21,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:55:21,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:55:21,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:55:21,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:55:21,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:55:21,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:55:21,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:55:21,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:55:21,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:55:21,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:55:21,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:55:21,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:55:21,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:55:21,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:55:21,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:55:21,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:55:21,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:55:21,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:55:21,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:55:21,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:55:21,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:55:21,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:55:21,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:55:21,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:55:21,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:55:21,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:55:21,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:55:21,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:55:21,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:55:21,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:55:21,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:55:21,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:55:21,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:55:21,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:55:21,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:55:21,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:55:21,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:55:21,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:55:21,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:55:21,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:55:21,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 03:55:21,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:55:21,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:55:21,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:55:21,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:55:21,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:55:21,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:55:21,673 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:55:21,673 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:55:21,674 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:55:21,674 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:55:21,675 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:55:21,675 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:55:21,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:55:21,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:55:21,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:55:21,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:55:21,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:55:21,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:55:21,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:55:21,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:55:21,679 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:55:21,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:55:21,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:55:21,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:55:21,680 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:55:21,680 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 03:55:21,680 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 03:55:21,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:55:21,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:55:21,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:55:21,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 03:55:21,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:55:21,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:21,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:55:21,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:55:21,683 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 03:55:21,683 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 03:55:21,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:55:21,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 03:55:21,684 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_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/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_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI 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 -> e2d96ac7da90505ebe789a14ca36a5b916234d7d0d8ab11cf581076a8deb0195 [2022-11-03 03:55:22,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:55:22,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:55:22,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:55:22,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:55:22,085 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:55:22,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i [2022-11-03 03:55:22,176 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/28e7b99fb/9b88326163014c63911274aba0edf94c/FLAGdd42d1a5b [2022-11-03 03:55:23,089 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:55:23,093 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i [2022-11-03 03:55:23,123 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/28e7b99fb/9b88326163014c63911274aba0edf94c/FLAGdd42d1a5b [2022-11-03 03:55:23,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/data/28e7b99fb/9b88326163014c63911274aba0edf94c [2022-11-03 03:55:23,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:55:23,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:55:23,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:23,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:55:23,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:55:23,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:23" (1/1) ... [2022-11-03 03:55:23,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37aa10a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:23, skipping insertion in model container [2022-11-03 03:55:23,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:23" (1/1) ... [2022-11-03 03:55:23,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:55:23,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:23,937 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_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i[33022,33035] [2022-11-03 03:55:24,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:24,255 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 03:55:24,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:24,314 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_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i[33022,33035] [2022-11-03 03:55:24,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:24,401 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:55:24,461 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_925ea5dd-7c46-4e21-95f8-65db3296a80c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-2.i[33022,33035] [2022-11-03 03:55:24,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:24,603 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:55:24,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24 WrapperNode [2022-11-03 03:55:24,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:24,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:24,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:55:24,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:55:24,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:24,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:24,883 INFO L138 Inliner]: procedures = 180, calls = 575, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2348 [2022-11-03 03:55:24,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:24,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:55:24,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:55:24,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:55:24,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:24,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:24,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:24,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,031 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:55:25,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:55:25,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:55:25,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:55:25,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (1/1) ... [2022-11-03 03:55:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:25,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:25,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:55:25,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:55:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 03:55:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-03 03:55:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-03 03:55:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 03:55:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 03:55:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 03:55:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 03:55:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 03:55:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:55:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:55:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:55:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:55:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 03:55:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:55:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:55:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 03:55:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 03:55:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:55:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:55:25,555 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:55:25,557 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:55:25,561 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:55:36,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:55:36,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:55:36,693 INFO L300 CfgBuilder]: Removed 160 assume(true) statements. [2022-11-03 03:55:36,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:36 BoogieIcfgContainer [2022-11-03 03:55:36,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:55:36,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:55:36,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:55:36,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:55:36,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:55:23" (1/3) ... [2022-11-03 03:55:36,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4485d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:36, skipping insertion in model container [2022-11-03 03:55:36,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:24" (2/3) ... [2022-11-03 03:55:36,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4485d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:36, skipping insertion in model container [2022-11-03 03:55:36,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:36" (3/3) ... [2022-11-03 03:55:36,709 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-2.i [2022-11-03 03:55:36,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:55:36,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1095 error locations. [2022-11-03 03:55:36,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:36,843 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@352bd1ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:36,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1095 error locations. [2022-11-03 03:55:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-03 03:55:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:55:36,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:36,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:55:36,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:55:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-03 03:55:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:36,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878725635] [2022-11-03 03:55:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:36,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:36,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 03:55:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:37,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:55:37,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:37,191 INFO L390 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 7 [2022-11-03 03:55:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:37,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:37,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:37,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878725635] [2022-11-03 03:55:37,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878725635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:37,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:37,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:55:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343869219] [2022-11-03 03:55:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:37,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:55:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:55:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:37,249 INFO L87 Difference]: Start difference. First operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:42,337 INFO L93 Difference]: Finished difference Result 2934 states and 3120 transitions. [2022-11-03 03:55:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:55:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:55:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:42,373 INFO L225 Difference]: With dead ends: 2934 [2022-11-03 03:55:42,374 INFO L226 Difference]: Without dead ends: 2932 [2022-11-03 03:55:42,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:42,382 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2142 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:42,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1869 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:55:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-11-03 03:55:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2401. [2022-11-03 03:55:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 1318 states have (on average 2.0515933232169954) internal successors, (2704), 2385 states have internal predecessors, (2704), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-03 03:55:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2736 transitions. [2022-11-03 03:55:42,542 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2736 transitions. Word has length 3 [2022-11-03 03:55:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:42,543 INFO L495 AbstractCegarLoop]: Abstraction has 2401 states and 2736 transitions. [2022-11-03 03:55:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2736 transitions. [2022-11-03 03:55:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:55:42,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:42,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:55:42,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:42,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:42,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:55:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-03 03:55:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:42,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695858906] [2022-11-03 03:55:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:42,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:42,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:42,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:42,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 03:55:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:42,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:55:42,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:42,984 INFO L390 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 [2022-11-03 03:55:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:43,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:43,000 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:43,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695858906] [2022-11-03 03:55:43,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695858906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:43,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:43,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:55:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299572139] [2022-11-03 03:55:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:43,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:55:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:55:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:43,004 INFO L87 Difference]: Start difference. First operand 2401 states and 2736 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:50,265 INFO L93 Difference]: Finished difference Result 3371 states and 3798 transitions. [2022-11-03 03:55:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:55:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:55:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:50,278 INFO L225 Difference]: With dead ends: 3371 [2022-11-03 03:55:50,279 INFO L226 Difference]: Without dead ends: 3371 [2022-11-03 03:55:50,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:55:50,280 INFO L413 NwaCegarLoop]: 1951 mSDtfsCounter, 1054 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:50,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3245 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-03 03:55:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-11-03 03:55:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2850. [2022-11-03 03:55:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 1765 states have (on average 2.009631728045326) internal successors, (3547), 2831 states have internal predecessors, (3547), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-03 03:55:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3585 transitions. [2022-11-03 03:55:50,349 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3585 transitions. Word has length 3 [2022-11-03 03:55:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:50,350 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 3585 transitions. [2022-11-03 03:55:50,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3585 transitions. [2022-11-03 03:55:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:55:50,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:50,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:50,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:50,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:55:50,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:55:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-03 03:55:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:55:50,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900862642] [2022-11-03 03:55:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:55:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:55:50,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:55:50,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 03:55:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:50,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:55:50,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:50,843 INFO L390 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 7 [2022-11-03 03:55:50,851 INFO L390 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 [2022-11-03 03:55:50,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:55:50,971 INFO L390 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 [2022-11-03 03:55:50,993 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:55:50,994 INFO L390 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 13 treesize of output 13 [2022-11-03 03:55:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:51,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:51,022 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:55:51,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900862642] [2022-11-03 03:55:51,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900862642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:51,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:51,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:55:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146468966] [2022-11-03 03:55:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:55:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:55:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:55:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:55:51,025 INFO L87 Difference]: Start difference. First operand 2850 states and 3585 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:04,734 INFO L93 Difference]: Finished difference Result 5481 states and 6388 transitions. [2022-11-03 03:56:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:04,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 03:56:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:04,752 INFO L225 Difference]: With dead ends: 5481 [2022-11-03 03:56:04,752 INFO L226 Difference]: Without dead ends: 5481 [2022-11-03 03:56:04,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:04,753 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 2765 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:04,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 2890 Invalid, 4283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4255 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-11-03 03:56:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2022-11-03 03:56:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3569. [2022-11-03 03:56:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 2484 states have (on average 2.0426731078904994) internal successors, (5074), 3544 states have internal predecessors, (5074), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 5124 transitions. [2022-11-03 03:56:04,839 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 5124 transitions. Word has length 7 [2022-11-03 03:56:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:04,839 INFO L495 AbstractCegarLoop]: Abstraction has 3569 states and 5124 transitions. [2022-11-03 03:56:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 5124 transitions. [2022-11-03 03:56:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:56:04,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:04,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:04,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:05,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:05,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-03 03:56:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:05,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402047407] [2022-11-03 03:56:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:05,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:05,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:05,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 03:56:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:05,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:56:05,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:05,288 INFO L390 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 7 [2022-11-03 03:56:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:05,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:05,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402047407] [2022-11-03 03:56:05,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402047407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:05,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:05,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:56:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662821015] [2022-11-03 03:56:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:05,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:05,306 INFO L87 Difference]: Start difference. First operand 3569 states and 5124 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:09,524 INFO L93 Difference]: Finished difference Result 4773 states and 6641 transitions. [2022-11-03 03:56:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:09,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:56:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:09,540 INFO L225 Difference]: With dead ends: 4773 [2022-11-03 03:56:09,540 INFO L226 Difference]: Without dead ends: 4773 [2022-11-03 03:56:09,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:09,542 INFO L413 NwaCegarLoop]: 2177 mSDtfsCounter, 1998 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:09,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2933 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 03:56:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2022-11-03 03:56:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3478. [2022-11-03 03:56:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 2484 states have (on average 1.9569243156199678) internal successors, (4861), 3453 states have internal predecessors, (4861), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4911 transitions. [2022-11-03 03:56:09,639 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4911 transitions. Word has length 8 [2022-11-03 03:56:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:09,640 INFO L495 AbstractCegarLoop]: Abstraction has 3478 states and 4911 transitions. [2022-11-03 03:56:09,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4911 transitions. [2022-11-03 03:56:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:56:09,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:09,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:09,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:09,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:09,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-03 03:56:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:09,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899853664] [2022-11-03 03:56:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:09,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:09,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:09,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 03:56:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:10,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:56:10,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:10,078 INFO L390 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 [2022-11-03 03:56:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:10,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:10,109 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:10,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899853664] [2022-11-03 03:56:10,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899853664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:10,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:10,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:56:10,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466655533] [2022-11-03 03:56:10,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:10,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:10,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:10,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:10,112 INFO L87 Difference]: Start difference. First operand 3478 states and 4911 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:16,659 INFO L93 Difference]: Finished difference Result 5193 states and 7269 transitions. [2022-11-03 03:56:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:56:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:16,673 INFO L225 Difference]: With dead ends: 5193 [2022-11-03 03:56:16,673 INFO L226 Difference]: Without dead ends: 5193 [2022-11-03 03:56:16,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:16,675 INFO L413 NwaCegarLoop]: 2557 mSDtfsCounter, 1369 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:16,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3648 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-03 03:56:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2022-11-03 03:56:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 3800. [2022-11-03 03:56:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 2816 states have (on average 1.9435369318181819) internal successors, (5473), 3775 states have internal predecessors, (5473), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5523 transitions. [2022-11-03 03:56:16,768 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5523 transitions. Word has length 8 [2022-11-03 03:56:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:16,768 INFO L495 AbstractCegarLoop]: Abstraction has 3800 states and 5523 transitions. [2022-11-03 03:56:16,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5523 transitions. [2022-11-03 03:56:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:56:16,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:16,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:16,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:16,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:16,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-11-03 03:56:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:16,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773436955] [2022-11-03 03:56:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:16,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:16,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 03:56:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:17,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:56:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:17,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:17,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:17,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773436955] [2022-11-03 03:56:17,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773436955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:17,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:17,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986098706] [2022-11-03 03:56:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:17,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:17,198 INFO L87 Difference]: Start difference. First operand 3800 states and 5523 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) [2022-11-03 03:56:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:17,253 INFO L93 Difference]: Finished difference Result 3740 states and 5437 transitions. [2022-11-03 03:56:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:17,254 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 [2022-11-03 03:56:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:17,276 INFO L225 Difference]: With dead ends: 3740 [2022-11-03 03:56:17,276 INFO L226 Difference]: Without dead ends: 3740 [2022-11-03 03:56:17,276 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:56:17,280 INFO L413 NwaCegarLoop]: 2221 mSDtfsCounter, 1011 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3437 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 [2022-11-03 03:56:17,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3437 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:56:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-11-03 03:56:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-11-03 03:56:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2780 states have (on average 1.9377697841726618) internal successors, (5387), 3715 states have internal predecessors, (5387), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5437 transitions. [2022-11-03 03:56:17,349 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5437 transitions. Word has length 11 [2022-11-03 03:56:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:17,351 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5437 transitions. [2022-11-03 03:56:17,351 INFO L496 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) [2022-11-03 03:56:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5437 transitions. [2022-11-03 03:56:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:56:17,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:17,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:17,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:17,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:17,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-11-03 03:56:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:17,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807849625] [2022-11-03 03:56:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:17,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:17,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 03:56:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:17,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:56:17,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:17,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:17,814 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:17,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807849625] [2022-11-03 03:56:17,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807849625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:17,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:56:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105701745] [2022-11-03 03:56:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:17,817 INFO L87 Difference]: Start difference. First operand 3740 states and 5437 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) [2022-11-03 03:56:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:17,948 INFO L93 Difference]: Finished difference Result 3712 states and 5381 transitions. [2022-11-03 03:56:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:17,949 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 [2022-11-03 03:56:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:17,961 INFO L225 Difference]: With dead ends: 3712 [2022-11-03 03:56:17,962 INFO L226 Difference]: Without dead ends: 3712 [2022-11-03 03:56:17,962 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:56:17,963 INFO L413 NwaCegarLoop]: 2176 mSDtfsCounter, 982 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 5561 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 [2022-11-03 03:56:17,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 5561 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2022-11-03 03:56:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3710. [2022-11-03 03:56:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 2764 states have (on average 1.9280028943560057) internal successors, (5329), 3685 states have internal predecessors, (5329), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5379 transitions. [2022-11-03 03:56:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5379 transitions. Word has length 13 [2022-11-03 03:56:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:18,036 INFO L495 AbstractCegarLoop]: Abstraction has 3710 states and 5379 transitions. [2022-11-03 03:56:18,036 INFO L496 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) [2022-11-03 03:56:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5379 transitions. [2022-11-03 03:56:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:56:18,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:18,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:18,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:18,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:18,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-03 03:56:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:18,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611125664] [2022-11-03 03:56:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:18,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:18,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 03:56:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:18,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:56:18,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:18,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:18,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:18,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611125664] [2022-11-03 03:56:18,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611125664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:18,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:18,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559168689] [2022-11-03 03:56:18,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:18,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:18,593 INFO L87 Difference]: Start difference. First operand 3710 states and 5379 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:18,655 INFO L93 Difference]: Finished difference Result 5158 states and 6946 transitions. [2022-11-03 03:56:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:18,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 03:56:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:18,673 INFO L225 Difference]: With dead ends: 5158 [2022-11-03 03:56:18,673 INFO L226 Difference]: Without dead ends: 5158 [2022-11-03 03:56:18,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:18,675 INFO L413 NwaCegarLoop]: 3496 mSDtfsCounter, 2102 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 5112 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 [2022-11-03 03:56:18,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 5112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:56:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2022-11-03 03:56:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 3650. [2022-11-03 03:56:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2728 states have (on average 1.9219208211143695) internal successors, (5243), 3625 states have internal predecessors, (5243), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5293 transitions. [2022-11-03 03:56:18,762 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 5293 transitions. Word has length 20 [2022-11-03 03:56:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:18,762 INFO L495 AbstractCegarLoop]: Abstraction has 3650 states and 5293 transitions. [2022-11-03 03:56:18,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 5293 transitions. [2022-11-03 03:56:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:56:18,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:18,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:18,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:18,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-11-03 03:56:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:18,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716586796] [2022-11-03 03:56:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:18,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:18,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:18,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:18,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 03:56:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:19,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:56:19,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:19,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:19,239 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:19,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716586796] [2022-11-03 03:56:19,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716586796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:19,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:19,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7075708] [2022-11-03 03:56:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:19,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:56:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:19,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:56:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:19,242 INFO L87 Difference]: Start difference. First operand 3650 states and 5293 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:19,318 INFO L93 Difference]: Finished difference Result 4991 states and 6655 transitions. [2022-11-03 03:56:19,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:56:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 03:56:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:19,329 INFO L225 Difference]: With dead ends: 4991 [2022-11-03 03:56:19,329 INFO L226 Difference]: Without dead ends: 4991 [2022-11-03 03:56:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:56:19,330 INFO L413 NwaCegarLoop]: 3628 mSDtfsCounter, 2059 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 5196 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 [2022-11-03 03:56:19,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 5196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:56:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2022-11-03 03:56:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 3518. [2022-11-03 03:56:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 2620 states have (on average 1.9026717557251909) internal successors, (4985), 3493 states have internal predecessors, (4985), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 5035 transitions. [2022-11-03 03:56:19,389 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 5035 transitions. Word has length 20 [2022-11-03 03:56:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:19,390 INFO L495 AbstractCegarLoop]: Abstraction has 3518 states and 5035 transitions. [2022-11-03 03:56:19,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 5035 transitions. [2022-11-03 03:56:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:56:19,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:19,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:19,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:19,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-03 03:56:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443581411] [2022-11-03 03:56:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:19,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:19,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:19,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:19,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 03:56:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:19,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:56:19,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:19,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:19,891 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:19,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443581411] [2022-11-03 03:56:19,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443581411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:19,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:19,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:56:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585986356] [2022-11-03 03:56:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:19,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:19,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:19,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:19,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:19,893 INFO L87 Difference]: Start difference. First operand 3518 states and 5035 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-03 03:56:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:20,015 INFO L93 Difference]: Finished difference Result 4956 states and 6589 transitions. [2022-11-03 03:56:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-03 03:56:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:20,026 INFO L225 Difference]: With dead ends: 4956 [2022-11-03 03:56:20,026 INFO L226 Difference]: Without dead ends: 4956 [2022-11-03 03:56:20,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:56:20,027 INFO L413 NwaCegarLoop]: 3588 mSDtfsCounter, 2030 mSDsluCounter, 5154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 8742 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 [2022-11-03 03:56:20,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 8742 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2022-11-03 03:56:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 3488. [2022-11-03 03:56:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2604 states have (on average 1.892089093701997) internal successors, (4927), 3463 states have internal predecessors, (4927), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4977 transitions. [2022-11-03 03:56:20,088 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4977 transitions. Word has length 22 [2022-11-03 03:56:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:20,089 INFO L495 AbstractCegarLoop]: Abstraction has 3488 states and 4977 transitions. [2022-11-03 03:56:20,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-03 03:56:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4977 transitions. [2022-11-03 03:56:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:56:20,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:20,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:20,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:20,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:20,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-11-03 03:56:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173373006] [2022-11-03 03:56:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:20,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:20,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 03:56:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:20,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:56:20,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:20,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:20,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:20,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173373006] [2022-11-03 03:56:20,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173373006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:20,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:20,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:56:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445000879] [2022-11-03 03:56:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:20,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:20,604 INFO L87 Difference]: Start difference. First operand 3488 states and 4977 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-03 03:56:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:20,749 INFO L93 Difference]: Finished difference Result 4883 states and 6400 transitions. [2022-11-03 03:56:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-03 03:56:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:20,761 INFO L225 Difference]: With dead ends: 4883 [2022-11-03 03:56:20,761 INFO L226 Difference]: Without dead ends: 4883 [2022-11-03 03:56:20,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:56:20,762 INFO L413 NwaCegarLoop]: 3513 mSDtfsCounter, 1995 mSDsluCounter, 5039 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 8552 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 [2022-11-03 03:56:20,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 8552 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:56:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2022-11-03 03:56:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3426. [2022-11-03 03:56:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 2556 states have (on average 1.859546165884194) internal successors, (4753), 3401 states have internal predecessors, (4753), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4803 transitions. [2022-11-03 03:56:20,820 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4803 transitions. Word has length 22 [2022-11-03 03:56:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:20,822 INFO L495 AbstractCegarLoop]: Abstraction has 3426 states and 4803 transitions. [2022-11-03 03:56:20,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-03 03:56:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4803 transitions. [2022-11-03 03:56:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:56:20,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:20,824 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:56:20,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:21,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:21,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-11-03 03:56:21,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:21,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8307731] [2022-11-03 03:56:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:21,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:21,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:21,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 03:56:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:21,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:56:21,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:21,287 INFO L390 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 7 [2022-11-03 03:56:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:21,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:21,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8307731] [2022-11-03 03:56:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8307731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:21,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:21,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94989820] [2022-11-03 03:56:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:21,366 INFO L87 Difference]: Start difference. First operand 3426 states and 4803 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) [2022-11-03 03:56:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:26,106 INFO L93 Difference]: Finished difference Result 3878 states and 5162 transitions. [2022-11-03 03:56:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:56:26,107 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 [2022-11-03 03:56:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:26,114 INFO L225 Difference]: With dead ends: 3878 [2022-11-03 03:56:26,114 INFO L226 Difference]: Without dead ends: 3878 [2022-11-03 03:56:26,114 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:56:26,115 INFO L413 NwaCegarLoop]: 1244 mSDtfsCounter, 2745 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2751 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:26,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2751 Valid, 2342 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-03 03:56:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-11-03 03:56:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3422. [2022-11-03 03:56:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2556 states have (on average 1.85641627543036) internal successors, (4745), 3397 states have internal predecessors, (4745), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4795 transitions. [2022-11-03 03:56:26,165 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4795 transitions. Word has length 27 [2022-11-03 03:56:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:26,165 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4795 transitions. [2022-11-03 03:56:26,166 INFO L496 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) [2022-11-03 03:56:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4795 transitions. [2022-11-03 03:56:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:56:26,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:26,166 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:56:26,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:26,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:26,380 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-11-03 03:56:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962828141] [2022-11-03 03:56:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:26,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:26,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 03:56:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:26,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:56:26,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:26,629 INFO L390 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 [2022-11-03 03:56:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:26,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:26,792 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:26,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962828141] [2022-11-03 03:56:26,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962828141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:26,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:26,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117576930] [2022-11-03 03:56:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:26,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:26,794 INFO L87 Difference]: Start difference. First operand 3422 states and 4795 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) [2022-11-03 03:56:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:34,316 INFO L93 Difference]: Finished difference Result 4323 states and 5779 transitions. [2022-11-03 03:56:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:56:34,317 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 [2022-11-03 03:56:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:34,333 INFO L225 Difference]: With dead ends: 4323 [2022-11-03 03:56:34,333 INFO L226 Difference]: Without dead ends: 4323 [2022-11-03 03:56:34,334 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:56:34,335 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 1907 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 3817 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:34,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 3817 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-03 03:56:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2022-11-03 03:56:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 3458. [2022-11-03 03:56:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2592 states have (on average 1.8464506172839505) internal successors, (4786), 3433 states have internal predecessors, (4786), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4836 transitions. [2022-11-03 03:56:34,393 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4836 transitions. Word has length 27 [2022-11-03 03:56:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:34,393 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4836 transitions. [2022-11-03 03:56:34,394 INFO L496 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) [2022-11-03 03:56:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4836 transitions. [2022-11-03 03:56:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:56:34,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:34,399 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:56:34,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:34,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:34,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-03 03:56:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:34,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890565660] [2022-11-03 03:56:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:34,614 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:34,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 03:56:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:34,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:56:34,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:34,921 INFO L390 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 7 [2022-11-03 03:56:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:35,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:35,010 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:35,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890565660] [2022-11-03 03:56:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890565660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:35,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:35,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658197193] [2022-11-03 03:56:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:35,012 INFO L87 Difference]: Start difference. First operand 3458 states and 4836 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:56:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:42,093 INFO L93 Difference]: Finished difference Result 6686 states and 9193 transitions. [2022-11-03 03:56:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:56:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 03:56:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:42,103 INFO L225 Difference]: With dead ends: 6686 [2022-11-03 03:56:42,104 INFO L226 Difference]: Without dead ends: 6686 [2022-11-03 03:56:42,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:56:42,105 INFO L413 NwaCegarLoop]: 2703 mSDtfsCounter, 3693 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:42,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3700 Valid, 4839 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-03 03:56:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2022-11-03 03:56:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 3454. [2022-11-03 03:56:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2592 states have (on average 1.8433641975308641) internal successors, (4778), 3429 states have internal predecessors, (4778), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4828 transitions. [2022-11-03 03:56:42,173 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4828 transitions. Word has length 36 [2022-11-03 03:56:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:42,174 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4828 transitions. [2022-11-03 03:56:42,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:56:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4828 transitions. [2022-11-03 03:56:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:56:42,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:42,175 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:56:42,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-03 03:56:42,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:42,390 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-03 03:56:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66517794] [2022-11-03 03:56:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:42,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:42,394 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:42,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 03:56:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:42,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:56:42,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:42,733 INFO L390 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 [2022-11-03 03:56:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:42,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:42,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66517794] [2022-11-03 03:56:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66517794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830539827] [2022-11-03 03:56:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:42,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:42,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:42,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:42,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:42,951 INFO L87 Difference]: Start difference. First operand 3454 states and 4828 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:56:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:53,065 INFO L93 Difference]: Finished difference Result 6369 states and 8585 transitions. [2022-11-03 03:56:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:56:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 03:56:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:53,074 INFO L225 Difference]: With dead ends: 6369 [2022-11-03 03:56:53,074 INFO L226 Difference]: Without dead ends: 6369 [2022-11-03 03:56:53,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:56:53,075 INFO L413 NwaCegarLoop]: 2653 mSDtfsCounter, 3063 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:53,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3067 Valid, 5267 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-11-03 03:56:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2022-11-03 03:56:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 3450. [2022-11-03 03:56:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2592 states have (on average 1.8402777777777777) internal successors, (4770), 3425 states have internal predecessors, (4770), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:56:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4820 transitions. [2022-11-03 03:56:53,136 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4820 transitions. Word has length 36 [2022-11-03 03:56:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:53,137 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4820 transitions. [2022-11-03 03:56:53,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:56:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4820 transitions. [2022-11-03 03:56:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:56:53,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:53,138 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:56:53,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-03 03:56:53,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:56:53,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:56:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-11-03 03:56:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:56:53,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008185621] [2022-11-03 03:56:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:53,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:56:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:56:53,354 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:56:53,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 03:56:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:53,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:56:53,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:53,661 INFO L390 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 7 [2022-11-03 03:56:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:53,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:56:53,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:56:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008185621] [2022-11-03 03:56:53,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008185621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:53,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:53,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:56:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617150636] [2022-11-03 03:56:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:56:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:56:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:56:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:56:53,762 INFO L87 Difference]: Start difference. First operand 3450 states and 4820 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:57:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:01,722 INFO L93 Difference]: Finished difference Result 7130 states and 9705 transitions. [2022-11-03 03:57:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:57:01,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 03:57:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:01,733 INFO L225 Difference]: With dead ends: 7130 [2022-11-03 03:57:01,733 INFO L226 Difference]: Without dead ends: 7130 [2022-11-03 03:57:01,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:01,734 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 4685 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:01,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 4597 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-03 03:57:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2022-11-03 03:57:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 3447. [2022-11-03 03:57:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8317901234567902) internal successors, (4748), 3422 states have internal predecessors, (4748), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:57:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4798 transitions. [2022-11-03 03:57:01,796 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4798 transitions. Word has length 36 [2022-11-03 03:57:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:01,797 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 4798 transitions. [2022-11-03 03:57:01,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:57:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4798 transitions. [2022-11-03 03:57:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:57:01,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:01,798 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:01,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:02,011 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-11-03 03:57:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:02,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315610212] [2022-11-03 03:57:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:02,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:02,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:02,013 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:02,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 03:57:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:02,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:57:02,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:02,299 INFO L390 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 [2022-11-03 03:57:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:02,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:02,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:02,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315610212] [2022-11-03 03:57:02,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315610212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:02,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:02,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369074795] [2022-11-03 03:57:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:02,516 INFO L87 Difference]: Start difference. First operand 3447 states and 4798 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:57:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:12,441 INFO L93 Difference]: Finished difference Result 5205 states and 6971 transitions. [2022-11-03 03:57:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:57:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 03:57:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:12,446 INFO L225 Difference]: With dead ends: 5205 [2022-11-03 03:57:12,446 INFO L226 Difference]: Without dead ends: 5205 [2022-11-03 03:57:12,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:12,448 INFO L413 NwaCegarLoop]: 2560 mSDtfsCounter, 2416 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 4747 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 4747 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-11-03 03:57:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2022-11-03 03:57:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 3447. [2022-11-03 03:57:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8287037037037037) internal successors, (4740), 3422 states have internal predecessors, (4740), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:57:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4790 transitions. [2022-11-03 03:57:12,527 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4790 transitions. Word has length 36 [2022-11-03 03:57:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:12,528 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 4790 transitions. [2022-11-03 03:57:12,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-11-03 03:57:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4790 transitions. [2022-11-03 03:57:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:57:12,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:12,530 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:12,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:12,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:12,739 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-11-03 03:57:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571859716] [2022-11-03 03:57:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:12,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:12,742 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:12,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 03:57:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:13,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:57:13,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:13,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:13,133 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:13,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571859716] [2022-11-03 03:57:13,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571859716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:13,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:13,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033210666] [2022-11-03 03:57:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:13,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:13,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:13,140 INFO L87 Difference]: Start difference. First operand 3447 states and 4790 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-11-03 03:57:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:13,234 INFO L93 Difference]: Finished difference Result 3435 states and 4766 transitions. [2022-11-03 03:57:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-11-03 03:57:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:13,239 INFO L225 Difference]: With dead ends: 3435 [2022-11-03 03:57:13,240 INFO L226 Difference]: Without dead ends: 3435 [2022-11-03 03:57:13,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:13,241 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 966 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 5042 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:13,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 5042 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2022-11-03 03:57:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2022-11-03 03:57:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2580 states have (on average 1.827906976744186) internal successors, (4716), 3410 states have internal predecessors, (4716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 03:57:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4766 transitions. [2022-11-03 03:57:13,301 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4766 transitions. Word has length 40 [2022-11-03 03:57:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:13,302 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4766 transitions. [2022-11-03 03:57:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-11-03 03:57:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4766 transitions. [2022-11-03 03:57:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 03:57:13,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:13,303 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:13,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:13,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-11-03 03:57:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583187425] [2022-11-03 03:57:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:13,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:13,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:13,527 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:13,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 03:57:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:57:13,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:14,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:14,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:14,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583187425] [2022-11-03 03:57:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583187425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:14,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959146159] [2022-11-03 03:57:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:57:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:57:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:14,091 INFO L87 Difference]: Start difference. First operand 3435 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2022-11-03 03:57:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:14,514 INFO L93 Difference]: Finished difference Result 5077 states and 6789 transitions. [2022-11-03 03:57:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:57:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-11-03 03:57:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:14,522 INFO L225 Difference]: With dead ends: 5077 [2022-11-03 03:57:14,522 INFO L226 Difference]: Without dead ends: 5077 [2022-11-03 03:57:14,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:14,523 INFO L413 NwaCegarLoop]: 2098 mSDtfsCounter, 1382 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:14,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 3952 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:57:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-11-03 03:57:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4452. [2022-11-03 03:57:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 3590 states have (on average 1.8147632311977715) internal successors, (6515), 4417 states have internal predecessors, (6515), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:57:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6585 transitions. [2022-11-03 03:57:14,591 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6585 transitions. Word has length 48 [2022-11-03 03:57:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:14,591 INFO L495 AbstractCegarLoop]: Abstraction has 4452 states and 6585 transitions. [2022-11-03 03:57:14,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2022-11-03 03:57:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6585 transitions. [2022-11-03 03:57:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 03:57:14,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:14,593 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:14,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:14,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:14,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-11-03 03:57:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:14,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691901857] [2022-11-03 03:57:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:14,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:14,814 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:14,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 03:57:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:15,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:57:15,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:15,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:15,244 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691901857] [2022-11-03 03:57:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691901857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:15,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:15,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51350214] [2022-11-03 03:57:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:15,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:15,247 INFO L87 Difference]: Start difference. First operand 4452 states and 6585 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-11-03 03:57:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:15,352 INFO L93 Difference]: Finished difference Result 5586 states and 7773 transitions. [2022-11-03 03:57:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-11-03 03:57:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:15,361 INFO L225 Difference]: With dead ends: 5586 [2022-11-03 03:57:15,361 INFO L226 Difference]: Without dead ends: 5586 [2022-11-03 03:57:15,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:15,363 INFO L413 NwaCegarLoop]: 3060 mSDtfsCounter, 1965 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 7417 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:15,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 7417 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-11-03 03:57:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 4410. [2022-11-03 03:57:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 3548 states have (on average 1.8165163472378805) internal successors, (6445), 4375 states have internal predecessors, (6445), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:57:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 6515 transitions. [2022-11-03 03:57:15,474 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 6515 transitions. Word has length 51 [2022-11-03 03:57:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:15,475 INFO L495 AbstractCegarLoop]: Abstraction has 4410 states and 6515 transitions. [2022-11-03 03:57:15,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-11-03 03:57:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 6515 transitions. [2022-11-03 03:57:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 03:57:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:15,476 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:15,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:15,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:15,694 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-03 03:57:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:15,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484303350] [2022-11-03 03:57:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:15,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:15,697 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:15,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 03:57:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:16,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:57:16,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:16,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:16,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:16,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484303350] [2022-11-03 03:57:16,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484303350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:16,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:16,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526046253] [2022-11-03 03:57:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:16,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:16,195 INFO L87 Difference]: Start difference. First operand 4410 states and 6515 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-11-03 03:57:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:16,303 INFO L93 Difference]: Finished difference Result 5322 states and 7259 transitions. [2022-11-03 03:57:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2022-11-03 03:57:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:16,311 INFO L225 Difference]: With dead ends: 5322 [2022-11-03 03:57:16,312 INFO L226 Difference]: Without dead ends: 5322 [2022-11-03 03:57:16,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:16,313 INFO L413 NwaCegarLoop]: 3322 mSDtfsCounter, 1956 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 7990 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:16,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 7990 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2022-11-03 03:57:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4392. [2022-11-03 03:57:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3530 states have (on average 1.8172804532577904) internal successors, (6415), 4357 states have internal predecessors, (6415), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:57:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6485 transitions. [2022-11-03 03:57:16,384 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6485 transitions. Word has length 54 [2022-11-03 03:57:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:16,384 INFO L495 AbstractCegarLoop]: Abstraction has 4392 states and 6485 transitions. [2022-11-03 03:57:16,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-11-03 03:57:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6485 transitions. [2022-11-03 03:57:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 03:57:16,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:16,386 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:16,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:16,603 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash -665468730, now seen corresponding path program 1 times [2022-11-03 03:57:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157835511] [2022-11-03 03:57:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:16,605 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:16,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 03:57:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:17,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:57:17,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:17,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:17,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:17,089 INFO L390 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 29 treesize of output 38 [2022-11-03 03:57:17,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:17,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-11-03 03:57:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:17,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:17,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:17,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157835511] [2022-11-03 03:57:17,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157835511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:17,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:17,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274185469] [2022-11-03 03:57:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:17,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:17,213 INFO L87 Difference]: Start difference. First operand 4392 states and 6485 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:19,636 INFO L93 Difference]: Finished difference Result 4496 states and 6595 transitions. [2022-11-03 03:57:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-03 03:57:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:19,648 INFO L225 Difference]: With dead ends: 4496 [2022-11-03 03:57:19,648 INFO L226 Difference]: Without dead ends: 4496 [2022-11-03 03:57:19,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:19,649 INFO L413 NwaCegarLoop]: 1895 mSDtfsCounter, 907 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:19,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4846 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 122 Unchecked, 2.3s Time] [2022-11-03 03:57:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2022-11-03 03:57:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4358. [2022-11-03 03:57:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4358 states, 3496 states have (on average 1.8249427917620138) internal successors, (6380), 4323 states have internal predecessors, (6380), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:57:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4358 states to 4358 states and 6450 transitions. [2022-11-03 03:57:19,711 INFO L78 Accepts]: Start accepts. Automaton has 4358 states and 6450 transitions. Word has length 57 [2022-11-03 03:57:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:19,712 INFO L495 AbstractCegarLoop]: Abstraction has 4358 states and 6450 transitions. [2022-11-03 03:57:19,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4358 states and 6450 transitions. [2022-11-03 03:57:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 03:57:19,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:19,713 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:19,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:19,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:19,930 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-11-03 03:57:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131966624] [2022-11-03 03:57:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:19,932 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:19,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-03 03:57:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:20,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:57:20,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:20,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:20,626 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:20,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131966624] [2022-11-03 03:57:20,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131966624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:20,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:20,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086308355] [2022-11-03 03:57:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:57:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:57:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:20,628 INFO L87 Difference]: Start difference. First operand 4358 states and 6450 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-11-03 03:57:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:20,873 INFO L93 Difference]: Finished difference Result 5982 states and 8540 transitions. [2022-11-03 03:57:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:57:20,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-11-03 03:57:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:20,881 INFO L225 Difference]: With dead ends: 5982 [2022-11-03 03:57:20,881 INFO L226 Difference]: Without dead ends: 5982 [2022-11-03 03:57:20,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:20,882 INFO L413 NwaCegarLoop]: 2433 mSDtfsCounter, 1079 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:20,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 4315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:57:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2022-11-03 03:57:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5431. [2022-11-03 03:57:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4561 states have (on average 1.8013593510195132) internal successors, (8216), 5385 states have internal predecessors, (8216), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:57:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 8308 transitions. [2022-11-03 03:57:20,950 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 8308 transitions. Word has length 59 [2022-11-03 03:57:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:20,950 INFO L495 AbstractCegarLoop]: Abstraction has 5431 states and 8308 transitions. [2022-11-03 03:57:20,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-11-03 03:57:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 8308 transitions. [2022-11-03 03:57:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 03:57:20,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:20,951 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:20,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:21,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:21,167 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-03 03:57:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951606845] [2022-11-03 03:57:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:21,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:21,170 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:21,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 03:57:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:21,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:57:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:21,716 INFO L390 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 [2022-11-03 03:57:21,723 INFO L390 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 7 [2022-11-03 03:57:22,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:22,328 INFO L390 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 [2022-11-03 03:57:22,348 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:57:22,348 INFO L390 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 13 treesize of output 13 [2022-11-03 03:57:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:22,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:22,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:22,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951606845] [2022-11-03 03:57:22,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951606845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:22,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:22,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733561370] [2022-11-03 03:57:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:22,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:22,367 INFO L87 Difference]: Start difference. First operand 5431 states and 8308 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-11-03 03:57:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:29,235 INFO L93 Difference]: Finished difference Result 7850 states and 12031 transitions. [2022-11-03 03:57:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-11-03 03:57:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:29,246 INFO L225 Difference]: With dead ends: 7850 [2022-11-03 03:57:29,246 INFO L226 Difference]: Without dead ends: 7850 [2022-11-03 03:57:29,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:29,247 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 4067 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:29,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 1363 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 03:57:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2022-11-03 03:57:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 5191. [2022-11-03 03:57:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4405 states have (on average 1.7332576617480135) internal successors, (7635), 5145 states have internal predecessors, (7635), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:57:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7727 transitions. [2022-11-03 03:57:29,367 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7727 transitions. Word has length 62 [2022-11-03 03:57:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:29,368 INFO L495 AbstractCegarLoop]: Abstraction has 5191 states and 7727 transitions. [2022-11-03 03:57:29,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-11-03 03:57:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7727 transitions. [2022-11-03 03:57:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 03:57:29,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:29,370 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:29,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:29,582 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-03 03:57:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:29,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249328533] [2022-11-03 03:57:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:29,585 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:29,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 03:57:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:57:30,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:30,050 INFO L390 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 7 [2022-11-03 03:57:30,066 INFO L390 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 [2022-11-03 03:57:30,106 INFO L390 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 23 treesize of output 11 [2022-11-03 03:57:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:30,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:30,122 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:30,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249328533] [2022-11-03 03:57:30,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249328533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:30,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:30,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:30,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453638652] [2022-11-03 03:57:30,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:30,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:57:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:57:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:30,126 INFO L87 Difference]: Start difference. First operand 5191 states and 7727 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:36,652 INFO L93 Difference]: Finished difference Result 5190 states and 7724 transitions. [2022-11-03 03:57:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:57:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 03:57:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:36,659 INFO L225 Difference]: With dead ends: 5190 [2022-11-03 03:57:36,659 INFO L226 Difference]: Without dead ends: 5190 [2022-11-03 03:57:36,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:57:36,667 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 4 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:36,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5114 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-03 03:57:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-11-03 03:57:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-11-03 03:57:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4405 states have (on average 1.7325766174801362) internal successors, (7632), 5144 states have internal predecessors, (7632), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:57:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7724 transitions. [2022-11-03 03:57:36,725 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7724 transitions. Word has length 67 [2022-11-03 03:57:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:36,725 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7724 transitions. [2022-11-03 03:57:36,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7724 transitions. [2022-11-03 03:57:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 03:57:36,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:36,727 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:36,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:36,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:36,946 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-03 03:57:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:36,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651601854] [2022-11-03 03:57:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:36,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:36,949 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:36,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-03 03:57:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:57:37,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:37,427 INFO L390 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 [2022-11-03 03:57:37,453 INFO L390 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 [2022-11-03 03:57:37,471 INFO L390 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 [2022-11-03 03:57:37,541 INFO L390 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 [2022-11-03 03:57:37,549 INFO L390 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 [2022-11-03 03:57:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:37,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:37,572 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651601854] [2022-11-03 03:57:37,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651601854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:37,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:37,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259293365] [2022-11-03 03:57:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:37,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:57:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:37,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:57:37,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:37,574 INFO L87 Difference]: Start difference. First operand 5190 states and 7724 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:47,163 INFO L93 Difference]: Finished difference Result 5189 states and 7721 transitions. [2022-11-03 03:57:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:57:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 03:57:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:47,171 INFO L225 Difference]: With dead ends: 5189 [2022-11-03 03:57:47,171 INFO L226 Difference]: Without dead ends: 5189 [2022-11-03 03:57:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:57:47,172 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 2 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5103 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-03 03:57:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2022-11-03 03:57:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5189. [2022-11-03 03:57:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 4402 states have (on average 1.7330758746024535) internal successors, (7629), 5143 states have internal predecessors, (7629), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:57:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 7721 transitions. [2022-11-03 03:57:47,241 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 7721 transitions. Word has length 67 [2022-11-03 03:57:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:47,241 INFO L495 AbstractCegarLoop]: Abstraction has 5189 states and 7721 transitions. [2022-11-03 03:57:47,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 7721 transitions. [2022-11-03 03:57:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 03:57:47,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:47,243 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:47,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:47,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:47,450 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-11-03 03:57:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:47,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696042535] [2022-11-03 03:57:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:47,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:47,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:47,452 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:47,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 03:57:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:47,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:57:47,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:47,956 INFO L390 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 7 [2022-11-03 03:57:47,978 INFO L390 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 [2022-11-03 03:57:48,016 INFO L390 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 23 treesize of output 11 [2022-11-03 03:57:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:48,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:48,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696042535] [2022-11-03 03:57:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696042535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:48,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:48,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442557015] [2022-11-03 03:57:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:48,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:57:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:57:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:48,030 INFO L87 Difference]: Start difference. First operand 5189 states and 7721 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:55,011 INFO L93 Difference]: Finished difference Result 5188 states and 7717 transitions. [2022-11-03 03:57:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:57:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 03:57:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:55,016 INFO L225 Difference]: With dead ends: 5188 [2022-11-03 03:57:55,016 INFO L226 Difference]: Without dead ends: 5188 [2022-11-03 03:57:55,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:57:55,017 INFO L413 NwaCegarLoop]: 1924 mSDtfsCounter, 4 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:55,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5109 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-03 03:57:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2022-11-03 03:57:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5188. [2022-11-03 03:57:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 4402 states have (on average 1.7321671967287597) internal successors, (7625), 5142 states have internal predecessors, (7625), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:57:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7717 transitions. [2022-11-03 03:57:55,072 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7717 transitions. Word has length 67 [2022-11-03 03:57:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:55,072 INFO L495 AbstractCegarLoop]: Abstraction has 5188 states and 7717 transitions. [2022-11-03 03:57:55,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:57:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7717 transitions. [2022-11-03 03:57:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 03:57:55,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:55,074 INFO L195 NwaCegarLoop]: 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] [2022-11-03 03:57:55,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:57:55,296 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:57:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-11-03 03:57:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:57:55,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304225591] [2022-11-03 03:57:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:57:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:57:55,298 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:57:55,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-03 03:57:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:55,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:57:55,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:55,776 INFO L390 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 [2022-11-03 03:57:55,796 INFO L390 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 [2022-11-03 03:57:55,806 INFO L390 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 [2022-11-03 03:57:55,855 INFO L390 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 [2022-11-03 03:57:55,857 INFO L390 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 [2022-11-03 03:57:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:55,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:57:55,875 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:57:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304225591] [2022-11-03 03:57:55,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304225591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:55,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494995416] [2022-11-03 03:57:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:55,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:57:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:57:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:57:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:55,877 INFO L87 Difference]: Start difference. First operand 5188 states and 7717 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:58:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:05,112 INFO L93 Difference]: Finished difference Result 5187 states and 7713 transitions. [2022-11-03 03:58:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:58:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 03:58:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:05,118 INFO L225 Difference]: With dead ends: 5187 [2022-11-03 03:58:05,118 INFO L226 Difference]: Without dead ends: 5187 [2022-11-03 03:58:05,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:58:05,119 INFO L413 NwaCegarLoop]: 1924 mSDtfsCounter, 2 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:05,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5098 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-03 03:58:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2022-11-03 03:58:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2022-11-03 03:58:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 4398 states have (on average 1.7328331059572533) internal successors, (7621), 5141 states have internal predecessors, (7621), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 03:58:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7713 transitions. [2022-11-03 03:58:05,191 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7713 transitions. Word has length 67 [2022-11-03 03:58:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:05,191 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7713 transitions. [2022-11-03 03:58:05,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-03 03:58:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7713 transitions. [2022-11-03 03:58:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 03:58:05,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:05,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:05,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:58:05,402 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:58:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1448028751, now seen corresponding path program 1 times [2022-11-03 03:58:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:58:05,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142224471] [2022-11-03 03:58:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:58:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:58:05,405 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:58:05,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-03 03:58:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:05,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:58:05,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:05,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:58:05,883 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:58:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142224471] [2022-11-03 03:58:05,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142224471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:58:05,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:58:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:58:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115395038] [2022-11-03 03:58:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:58:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:58:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:58:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:58:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:58:05,887 INFO L87 Difference]: Start difference. First operand 5187 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2022-11-03 03:58:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:05,978 INFO L93 Difference]: Finished difference Result 5190 states and 7722 transitions. [2022-11-03 03:58:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:58:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-11-03 03:58:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:05,989 INFO L225 Difference]: With dead ends: 5190 [2022-11-03 03:58:05,990 INFO L226 Difference]: Without dead ends: 5190 [2022-11-03 03:58:05,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:58:05,991 INFO L413 NwaCegarLoop]: 1923 mSDtfsCounter, 2 mSDsluCounter, 3838 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:05,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5761 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:58:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-11-03 03:58:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-11-03 03:58:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4400 states have (on average 1.7327272727272727) internal successors, (7624), 5144 states have internal predecessors, (7624), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 03:58:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7722 transitions. [2022-11-03 03:58:06,073 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7722 transitions. Word has length 75 [2022-11-03 03:58:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:06,073 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7722 transitions. [2022-11-03 03:58:06,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2022-11-03 03:58:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7722 transitions. [2022-11-03 03:58:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-03 03:58:06,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:06,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:06,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:06,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:58:06,295 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:58:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1074294312, now seen corresponding path program 1 times [2022-11-03 03:58:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:58:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743395829] [2022-11-03 03:58:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:58:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:58:06,297 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:58:06,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 03:58:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:06,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:58:06,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:06,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:06,956 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:58:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743395829] [2022-11-03 03:58:06,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743395829] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [269995030] [2022-11-03 03:58:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:58:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:58:06,961 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:58:06,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-03 03:58:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:07,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:58:07,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:07,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:07,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [269995030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209442638] [2022-11-03 03:58:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:07,895 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:07,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 03:58:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:08,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:58:08,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:08,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:08,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209442638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:08,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:58:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 03:58:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160514145] [2022-11-03 03:58:08,482 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:58:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:58:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:58:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:58:08,483 INFO L87 Difference]: Start difference. First operand 5190 states and 7722 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2022-11-03 03:58:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:08,836 INFO L93 Difference]: Finished difference Result 5202 states and 7744 transitions. [2022-11-03 03:58:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:58:08,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2022-11-03 03:58:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:08,854 INFO L225 Difference]: With dead ends: 5202 [2022-11-03 03:58:08,855 INFO L226 Difference]: Without dead ends: 5202 [2022-11-03 03:58:08,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:58:08,856 INFO L413 NwaCegarLoop]: 1923 mSDtfsCounter, 16 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7677 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:08,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7677 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:58:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2022-11-03 03:58:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5200. [2022-11-03 03:58:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4409 states have (on average 1.732592424586074) internal successors, (7639), 5153 states have internal predecessors, (7639), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 03:58:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7737 transitions. [2022-11-03 03:58:08,941 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7737 transitions. Word has length 76 [2022-11-03 03:58:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:08,941 INFO L495 AbstractCegarLoop]: Abstraction has 5200 states and 7737 transitions. [2022-11-03 03:58:08,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2022-11-03 03:58:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7737 transitions. [2022-11-03 03:58:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-03 03:58:08,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:08,943 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:08,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:09,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:09,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:58:09,559 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:58:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522737, now seen corresponding path program 2 times [2022-11-03 03:58:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:58:09,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205016241] [2022-11-03 03:58:09,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:58:09,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:58:09,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:58:09,566 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:58:09,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-03 03:58:10,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:58:10,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:10,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:58:10,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:10,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:10,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:58:10,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205016241] [2022-11-03 03:58:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205016241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1921863448] [2022-11-03 03:58:10,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:58:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:58:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:58:10,834 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:58:10,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-03 03:58:13,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:58:13,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:13,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:58:13,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:13,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:13,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1921863448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:13,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327909226] [2022-11-03 03:58:13,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:58:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:13,611 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:13,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 03:58:36,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:58:36,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:36,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:58:36,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:37,051 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:58:37,051 INFO L390 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 13 treesize of output 13 [2022-11-03 03:58:37,099 INFO L390 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 [2022-11-03 03:58:37,648 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:58:37,649 INFO L390 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 36 treesize of output 37 [2022-11-03 03:58:37,763 INFO L390 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 33 treesize of output 15 [2022-11-03 03:58:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:58:37,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:37,955 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 03:58:37,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 03:58:37,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-03 03:58:37,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327909226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:37,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 03:58:37,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-03 03:58:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735580856] [2022-11-03 03:58:37,974 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 03:58:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:58:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 03:58:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-03 03:58:37,976 INFO L87 Difference]: Start difference. First operand 5200 states and 7737 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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) [2022-11-03 03:59:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:23,159 INFO L93 Difference]: Finished difference Result 13919 states and 21478 transitions. [2022-11-03 03:59:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 03:59:23,160 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 79 [2022-11-03 03:59:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:23,188 INFO L225 Difference]: With dead ends: 13919 [2022-11-03 03:59:23,188 INFO L226 Difference]: Without dead ends: 13919 [2022-11-03 03:59:23,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-03 03:59:23,189 INFO L413 NwaCegarLoop]: 2061 mSDtfsCounter, 3986 mSDsluCounter, 33848 mSDsCounter, 0 mSdLazyCounter, 24864 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4000 SdHoareTripleChecker+Valid, 35909 SdHoareTripleChecker+Invalid, 26237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 24864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1287 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:23,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4000 Valid, 35909 Invalid, 26237 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [86 Valid, 24864 Invalid, 0 Unknown, 1287 Unchecked, 43.4s Time] [2022-11-03 03:59:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13919 states. [2022-11-03 03:59:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13919 to 5206. [2022-11-03 03:59:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4415 states have (on average 1.7320498301245753) internal successors, (7647), 5159 states have internal predecessors, (7647), 46 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (56), 43 states have call predecessors, (56), 46 states have call successors, (56) [2022-11-03 03:59:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 7749 transitions. [2022-11-03 03:59:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 7749 transitions. Word has length 79 [2022-11-03 03:59:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:23,314 INFO L495 AbstractCegarLoop]: Abstraction has 5206 states and 7749 transitions. [2022-11-03 03:59:23,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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) [2022-11-03 03:59:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 7749 transitions. [2022-11-03 03:59:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-03 03:59:23,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:23,316 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:23,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:23,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:23,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:59:23,943 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:59:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1072291653, now seen corresponding path program 1 times [2022-11-03 03:59:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:59:23,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581235699] [2022-11-03 03:59:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:23,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:59:23,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:59:23,945 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:59:23,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-03 03:59:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:24,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:59:24,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:24,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:24,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:59:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581235699] [2022-11-03 03:59:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581235699] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180666874] [2022-11-03 03:59:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:24,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:59:24,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:59:24,743 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:59:24,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-03 03:59:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:25,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:59:25,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:25,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:25,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180666874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068658455] [2022-11-03 03:59:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:25,679 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:25,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 03:59:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:26,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:59:26,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:26,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:26,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068658455] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:26,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:59:26,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2022-11-03 03:59:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507236540] [2022-11-03 03:59:26,651 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:26,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:59:26,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:59:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:59:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:59:26,653 INFO L87 Difference]: Start difference. First operand 5206 states and 7749 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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) [2022-11-03 03:59:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:28,096 INFO L93 Difference]: Finished difference Result 5222 states and 7777 transitions. [2022-11-03 03:59:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 03:59:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 79 [2022-11-03 03:59:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:28,135 INFO L225 Difference]: With dead ends: 5222 [2022-11-03 03:59:28,135 INFO L226 Difference]: Without dead ends: 5214 [2022-11-03 03:59:28,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:59:28,136 INFO L413 NwaCegarLoop]: 1923 mSDtfsCounter, 96 mSDsluCounter, 11512 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 13435 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:28,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 13435 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:59:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2022-11-03 03:59:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 5208. [2022-11-03 03:59:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 4418 states have (on average 1.7308736985061113) internal successors, (7647), 5161 states have internal predecessors, (7647), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 03:59:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 7745 transitions. [2022-11-03 03:59:28,218 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 7745 transitions. Word has length 79 [2022-11-03 03:59:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:28,219 INFO L495 AbstractCegarLoop]: Abstraction has 5208 states and 7745 transitions. [2022-11-03 03:59:28,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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) [2022-11-03 03:59:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 7745 transitions. [2022-11-03 03:59:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-03 03:59:28,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:28,221 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:28,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:28,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:28,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:28,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:59:28,840 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:59:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 873906672, now seen corresponding path program 1 times [2022-11-03 03:59:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:59:28,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021689848] [2022-11-03 03:59:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:59:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:59:28,842 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:59:28,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-03 03:59:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:29,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:59:29,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:29,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:30,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:59:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021689848] [2022-11-03 03:59:30,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021689848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341126250] [2022-11-03 03:59:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:59:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:59:30,319 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:59:30,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-03 03:59:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:31,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:59:31,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:31,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:31,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1341126250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944242505] [2022-11-03 03:59:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:31,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:31,532 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:31,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 03:59:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:32,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 03:59:32,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:32,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:33,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944242505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:33,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 03:59:33,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-03 03:59:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256121903] [2022-11-03 03:59:33,430 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:59:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:59:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:59:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 03:59:33,432 INFO L87 Difference]: Start difference. First operand 5208 states and 7745 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2022-11-03 03:59:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:38,681 INFO L93 Difference]: Finished difference Result 5248 states and 7840 transitions. [2022-11-03 03:59:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-03 03:59:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2022-11-03 03:59:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:38,694 INFO L225 Difference]: With dead ends: 5248 [2022-11-03 03:59:38,694 INFO L226 Difference]: Without dead ends: 5242 [2022-11-03 03:59:38,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1590, Invalid=3240, Unknown=0, NotChecked=0, Total=4830 [2022-11-03 03:59:38,696 INFO L413 NwaCegarLoop]: 1928 mSDtfsCounter, 160 mSDsluCounter, 24995 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 26923 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:38,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 26923 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 03:59:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2022-11-03 03:59:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5226. [2022-11-03 03:59:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 4436 states have (on average 1.7290351668169521) internal successors, (7670), 5179 states have internal predecessors, (7670), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 03:59:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7768 transitions. [2022-11-03 03:59:38,796 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7768 transitions. Word has length 85 [2022-11-03 03:59:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:38,797 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7768 transitions. [2022-11-03 03:59:38,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2022-11-03 03:59:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7768 transitions. [2022-11-03 03:59:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-03 03:59:38,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:38,799 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:38,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:39,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:39,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:39,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:39,419 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 03:59:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash -575079248, now seen corresponding path program 2 times [2022-11-03 03:59:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:59:39,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519989583] [2022-11-03 03:59:39,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:59:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:59:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:59:39,421 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:59:39,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-03 03:59:40,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:59:40,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:40,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:59:40,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:40,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:43,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:59:43,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519989583] [2022-11-03 03:59:43,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519989583] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2091013659] [2022-11-03 03:59:43,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:59:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:59:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:59:43,563 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:59:43,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-03 03:59:46,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 03:59:46,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:46,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:59:46,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:46,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:46,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2091013659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:46,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295134928] [2022-11-03 03:59:46,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:59:46,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:46,678 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:46,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 04:00:11,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:00:11,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:11,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-03 04:00:11,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:12,198 INFO L390 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 [2022-11-03 04:00:12,216 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:12,216 INFO L390 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 13 treesize of output 13 [2022-11-03 04:00:12,356 INFO L390 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 [2022-11-03 04:00:12,369 INFO L390 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 [2022-11-03 04:00:12,797 INFO L390 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 [2022-11-03 04:00:12,806 INFO L390 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 [2022-11-03 04:00:13,204 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3940))) (exists ((v_ArrVal_3941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3941) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:13,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945)))) is different from true [2022-11-03 04:00:13,595 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:13,624 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:13,638 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952)))) is different from true [2022-11-03 04:00:14,034 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:14,048 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961)))) is different from true [2022-11-03 04:00:14,246 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965)))) is different from true [2022-11-03 04:00:14,262 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967))) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-03 04:00:14,276 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:14,290 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:00:14,305 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972))) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973)))) is different from true [2022-11-03 04:00:14,509 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3976) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3977)))) is different from true [2022-11-03 04:00:14,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3979))) (exists ((v_ArrVal_3978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3978)))) is different from true [2022-11-03 04:00:14,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:00:14,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:14,599 INFO L390 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 [2022-11-03 04:00:14,608 INFO L390 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 [2022-11-03 04:00:14,869 INFO L390 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 [2022-11-03 04:00:14,878 INFO L390 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 [2022-11-03 04:00:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 225 not checked. [2022-11-03 04:00:15,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:16,074 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4028 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4029 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-03 04:00:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295134928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:16,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 04:00:16,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 24] total 73 [2022-11-03 04:00:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035786547] [2022-11-03 04:00:16,082 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-03 04:00:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-03 04:00:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2834, Unknown=42, NotChecked=2096, Total=5700 [2022-11-03 04:00:16,086 INFO L87 Difference]: Start difference. First operand 5226 states and 7768 transitions. Second operand has 73 states, 72 states have (on average 2.75) internal successors, (198), 73 states have internal predecessors, (198), 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) [2022-11-03 04:01:12,765 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3976) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959))) (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981))) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3940))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3979))) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945))) (exists ((v_ArrVal_3938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3938))) (exists ((v_ArrVal_3941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3941) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952))) (exists ((v_ArrVal_3977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3977))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972))) (exists ((v_ArrVal_3978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3978))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961))) (exists ((v_ArrVal_3939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3939))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:02:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:51,696 INFO L93 Difference]: Finished difference Result 14036 states and 21619 transitions. [2022-11-03 04:02:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-11-03 04:02:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.75) internal successors, (198), 73 states have internal predecessors, (198), 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 97 [2022-11-03 04:02:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:51,728 INFO L225 Difference]: With dead ends: 14036 [2022-11-03 04:02:51,728 INFO L226 Difference]: Without dead ends: 14028 [2022-11-03 04:02:51,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 406 SyntacticMatches, 7 SemanticMatches, 148 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 3671 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=4133, Invalid=13216, Unknown=275, NotChecked=4726, Total=22350 [2022-11-03 04:02:51,734 INFO L413 NwaCegarLoop]: 1986 mSDtfsCounter, 4102 mSDsluCounter, 62636 mSDsCounter, 0 mSdLazyCounter, 49490 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 88.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 64622 SdHoareTripleChecker+Invalid, 116549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 49490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66918 IncrementalHoareTripleChecker+Unchecked, 100.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:51,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 64622 Invalid, 116549 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [141 Valid, 49490 Invalid, 0 Unknown, 66918 Unchecked, 100.3s Time] [2022-11-03 04:02:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14028 states. [2022-11-03 04:02:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14028 to 5308. [2022-11-03 04:02:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 4518 states have (on average 1.7189021691013724) internal successors, (7766), 5260 states have internal predecessors, (7766), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 04:02:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7864 transitions. [2022-11-03 04:02:51,878 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7864 transitions. Word has length 97 [2022-11-03 04:02:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:51,878 INFO L495 AbstractCegarLoop]: Abstraction has 5308 states and 7864 transitions. [2022-11-03 04:02:51,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.75) internal successors, (198), 73 states have internal predecessors, (198), 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) [2022-11-03 04:02:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7864 transitions. [2022-11-03 04:02:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-03 04:02:51,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:51,882 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:51,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:52,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:52,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:52,499 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 04:02:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2043408069, now seen corresponding path program 2 times [2022-11-03 04:02:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:52,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443245540] [2022-11-03 04:02:52,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:02:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:52,502 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:52,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-03 04:02:53,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 04:02:53,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:53,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:02:53,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:53,174 INFO L390 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 7 [2022-11-03 04:02:53,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:53,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:53,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:02:53,190 INFO L390 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 30 treesize of output 39 [2022-11-03 04:02:53,334 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:53,334 INFO L390 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 13 treesize of output 13 [2022-11-03 04:02:53,458 INFO L390 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 45 treesize of output 41 [2022-11-03 04:02:53,571 INFO L390 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 45 treesize of output 41 [2022-11-03 04:02:53,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:53,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-03 04:02:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-03 04:02:53,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:53,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443245540] [2022-11-03 04:02:53,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443245540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:53,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:53,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 04:02:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620796118] [2022-11-03 04:02:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:02:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:02:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:02:53,698 INFO L87 Difference]: Start difference. First operand 5308 states and 7864 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2022-11-03 04:03:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:02,612 INFO L93 Difference]: Finished difference Result 5320 states and 7618 transitions. [2022-11-03 04:03:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:03:02,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2022-11-03 04:03:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:02,622 INFO L225 Difference]: With dead ends: 5320 [2022-11-03 04:03:02,622 INFO L226 Difference]: Without dead ends: 5320 [2022-11-03 04:03:02,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-03 04:03:02,623 INFO L413 NwaCegarLoop]: 1144 mSDtfsCounter, 1921 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:02,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 3768 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-03 04:03:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2022-11-03 04:03:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 4907. [2022-11-03 04:03:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4907 states, 4118 states have (on average 1.7421078193297717) internal successors, (7174), 4862 states have internal predecessors, (7174), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 04:03:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 7265 transitions. [2022-11-03 04:03:02,748 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 7265 transitions. Word has length 119 [2022-11-03 04:03:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:02,748 INFO L495 AbstractCegarLoop]: Abstraction has 4907 states and 7265 transitions. [2022-11-03 04:03:02,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2022-11-03 04:03:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 7265 transitions. [2022-11-03 04:03:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-03 04:03:02,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:02,750 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:02,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:03:02,971 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 04:03:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2104518823, now seen corresponding path program 1 times [2022-11-03 04:03:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:02,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742784155] [2022-11-03 04:03:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:02,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:02,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:02,975 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:03,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-03 04:03:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:04,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 04:03:04,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:04,165 INFO L390 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 7 [2022-11-03 04:03:04,327 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:03:04,327 INFO L390 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 19 treesize of output 27 [2022-11-03 04:03:04,359 INFO L390 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 [2022-11-03 04:03:04,483 INFO L390 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 24 treesize of output 12 [2022-11-03 04:03:06,941 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:06,941 INFO L390 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 36 treesize of output 37 [2022-11-03 04:03:07,088 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:07,088 INFO L390 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 36 treesize of output 37 [2022-11-03 04:03:07,115 INFO L390 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 33 treesize of output 15 [2022-11-03 04:03:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-03 04:03:07,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:07,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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_4830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-03 04:03:07,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (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~mem39#1.base| v_ArrVal_4876))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 04:03:07,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:07,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742784155] [2022-11-03 04:03:07,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742784155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:07,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136314115] [2022-11-03 04:03:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:03:07,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:03:07,657 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:03:07,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-03 04:03:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:12,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 04:03:12,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:12,686 INFO L390 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 7 [2022-11-03 04:03:12,852 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:03:12,853 INFO L390 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 19 treesize of output 27 [2022-11-03 04:03:12,872 INFO L390 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 [2022-11-03 04:03:12,943 INFO L390 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 24 treesize of output 12 [2022-11-03 04:03:14,596 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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 [2022-11-03 04:03:14,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295)))) is different from true [2022-11-03 04:03:14,955 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297)))) is different from true [2022-11-03 04:03:15,022 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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 [2022-11-03 04:03:15,085 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:15,085 INFO L390 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 36 treesize of output 37 [2022-11-03 04:03:15,180 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:15,180 INFO L390 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 36 treesize of output 37 [2022-11-03 04:03:15,204 INFO L390 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 33 treesize of output 15 [2022-11-03 04:03:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-03 04:03:15,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:15,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5300) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-03 04:03:15,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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_5300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-03 04:03:15,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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~mem39#1.base| v_ArrVal_5346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 04:03:15,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136314115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:15,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642824650] [2022-11-03 04:03:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:15,594 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:15,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-03 04:03:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:16,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:03:16,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:16,636 INFO L390 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 6 treesize of output 5 [2022-11-03 04:03:16,749 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 04:03:16,749 INFO L390 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 29 [2022-11-03 04:03:16,850 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 04:03:16,850 INFO L390 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 38 treesize of output 17 [2022-11-03 04:03:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-03 04:03:16,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:03:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642824650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:16,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:03:16,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 13] total 17 [2022-11-03 04:03:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860680538] [2022-11-03 04:03:16,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:16,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:03:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:16,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:03:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=178, Unknown=23, NotChecked=324, Total=600 [2022-11-03 04:03:16,890 INFO L87 Difference]: Start difference. First operand 4907 states and 7265 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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) [2022-11-03 04:03:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:17,001 INFO L93 Difference]: Finished difference Result 4908 states and 7263 transitions. [2022-11-03 04:03:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:03:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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 122 [2022-11-03 04:03:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:17,007 INFO L225 Difference]: With dead ends: 4908 [2022-11-03 04:03:17,007 INFO L226 Difference]: Without dead ends: 4906 [2022-11-03 04:03:17,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 266 SyntacticMatches, 88 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=75, Invalid=178, Unknown=23, NotChecked=324, Total=600 [2022-11-03 04:03:17,008 INFO L413 NwaCegarLoop]: 1914 mSDtfsCounter, 14 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 857 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2998 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 857 Unchecked, 0.1s Time] [2022-11-03 04:03:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2022-11-03 04:03:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4906. [2022-11-03 04:03:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4118 states have (on average 1.7404079650315687) internal successors, (7167), 4861 states have internal predecessors, (7167), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 04:03:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 7258 transitions. [2022-11-03 04:03:17,064 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 7258 transitions. Word has length 122 [2022-11-03 04:03:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:17,064 INFO L495 AbstractCegarLoop]: Abstraction has 4906 states and 7258 transitions. [2022-11-03 04:03:17,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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) [2022-11-03 04:03:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 7258 transitions. [2022-11-03 04:03:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-03 04:03:17,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:17,066 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:17,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:17,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:17,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:17,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:17,689 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 04:03:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2104518822, now seen corresponding path program 1 times [2022-11-03 04:03:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:17,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015302185] [2022-11-03 04:03:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:17,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:17,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:17,692 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:17,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-03 04:03:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:18,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-03 04:03:18,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:18,979 INFO L390 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 7 [2022-11-03 04:03:19,161 INFO L390 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 [2022-11-03 04:03:19,178 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:03:19,179 INFO L390 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 13 treesize of output 13 [2022-11-03 04:03:19,206 INFO L390 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 [2022-11-03 04:03:19,224 INFO L390 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 [2022-11-03 04:03:19,366 INFO L390 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 [2022-11-03 04:03:19,373 INFO L390 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 [2022-11-03 04:03:19,455 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6106))) (exists ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6107) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,522 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6111) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6110))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,536 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6112))) (exists ((v_ArrVal_6113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6113))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,593 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6117))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6116) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:19,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6121))) (exists ((v_ArrVal_6120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6120) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,673 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6122 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6122) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6123 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6123)))) is different from true [2022-11-03 04:03:19,760 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6128) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6129)))) is different from true [2022-11-03 04:03:19,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6137))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,945 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6141))) (exists ((v_ArrVal_6140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6140))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:19,993 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6144)))) is different from true [2022-11-03 04:03:20,042 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6149))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6148)))) is different from true [2022-11-03 04:03:20,057 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6151))) (exists ((v_ArrVal_6150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6150) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,147 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6156) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6157)))) is different from true [2022-11-03 04:03:20,161 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6159) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,173 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6161) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6160)))) is different from true [2022-11-03 04:03:20,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6163))) (exists ((v_ArrVal_6162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6162))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,198 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6165))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6171) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6170) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:20,335 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6174) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6175)))) is different from true [2022-11-03 04:03:20,348 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6176))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,360 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6179))) (exists ((v_ArrVal_6178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6178))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6182))) (exists ((v_ArrVal_6183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6183))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:20,533 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6189))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6188)))) is different from true [2022-11-03 04:03:20,547 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6190))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6191) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:20,561 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6193) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6192) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:03:20,618 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:20,619 INFO L390 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 [2022-11-03 04:03:20,634 INFO L390 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 [2022-11-03 04:03:20,764 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:20,765 INFO L390 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 [2022-11-03 04:03:20,778 INFO L390 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 [2022-11-03 04:03:20,810 INFO L390 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 [2022-11-03 04:03:20,820 INFO L390 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 [2022-11-03 04:03:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2022-11-03 04:03:20,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:21,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-03 04:03:21,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 04:03:22,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6287))) (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~mem39#1.base| v_ArrVal_6286) .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6286) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 04:03:22,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015302185] [2022-11-03 04:03:22,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015302185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126682782] [2022-11-03 04:03:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:22,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:03:22,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:03:22,165 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:03:22,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-03 04:03:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:27,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 04:03:27,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:27,300 INFO L390 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 7 [2022-11-03 04:03:27,307 INFO L390 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 [2022-11-03 04:03:27,872 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:03:27,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-03 04:03:27,909 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:03:27,909 INFO L390 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 13 treesize of output 13 [2022-11-03 04:03:27,989 INFO L390 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 [2022-11-03 04:03:28,007 INFO L390 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 [2022-11-03 04:03:28,147 INFO L390 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 [2022-11-03 04:03:28,238 INFO L390 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 7 treesize of output 3 [2022-11-03 04:03:28,465 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6671) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:03:28,573 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6673) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:03:29,475 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6683))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:03:29,999 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6689)))) is different from true [2022-11-03 04:03:30,943 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6699))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:03:31,188 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6702) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:03:31,993 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6711)))) is different from true [2022-11-03 04:03:32,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:32,236 INFO L390 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 16 treesize of output 18 [2022-11-03 04:03:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:32,524 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-03 04:03:32,552 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 04:03:32,552 INFO L390 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 60 treesize of output 44 [2022-11-03 04:03:32,729 INFO L390 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 23 treesize of output 15 [2022-11-03 04:03:32,734 INFO L390 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 26 treesize of output 14 [2022-11-03 04:03:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-11-03 04:03:32,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:33,280 INFO L390 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 231 treesize of output 159 [2022-11-03 04:03:43,124 WARN L234 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:03:43,694 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6763))) (let ((.cse1 (select |c_#length| v_arrayElimCell_74)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd (_ bv20 32) .cse0) .cse1)) (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv8 32) (select (select (store .cse3 v_arrayElimCell_74 (store (select .cse3 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse0) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (or (bvule .cse2 .cse1) (forall ((v_ArrVal_6717 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_6717)))))))))) (forall ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6763))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd (_ bv20 32) .cse5) (select |c_#length| v_arrayElimCell_74))) (forall ((v_ArrVal_6716 (_ BitVec 32))) (let ((.cse6 (select (select (store .cse7 v_arrayElimCell_74 (store (select .cse7 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse5) v_ArrVal_6716)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6)))))))))) is different from false [2022-11-03 04:03:43,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1126682782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:43,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424951201] [2022-11-03 04:03:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:43,722 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:43,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-03 04:03:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:44,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 04:03:44,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:44,974 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:03:44,975 INFO L390 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 13 treesize of output 13 [2022-11-03 04:03:44,990 INFO L390 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 [2022-11-03 04:03:45,001 INFO L390 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 [2022-11-03 04:03:45,013 INFO L390 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 [2022-11-03 04:03:45,105 INFO L390 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 [2022-11-03 04:03:45,111 INFO L390 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 [2022-11-03 04:03:45,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,218 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7147))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,241 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,263 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:45,285 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:03:45,305 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,350 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159)))) is different from true [2022-11-03 04:03:45,372 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7161) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:03:45,393 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162))) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,414 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164))) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,435 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,455 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,478 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,502 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172))) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,605 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177)))) is different from true [2022-11-03 04:03:45,626 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,702 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183))) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,724 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,770 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188)))) is different from true [2022-11-03 04:03:45,792 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7191)))) is different from true [2022-11-03 04:03:45,877 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,896 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,915 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:45,982 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,000 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:03:46,020 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206)))) is different from true [2022-11-03 04:03:46,038 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208)))) is different from true [2022-11-03 04:03:46,150 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,177 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,196 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7220) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7221) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,284 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 04:03:46,305 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227)))) is different from true [2022-11-03 04:03:46,328 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229)))) is different from true [2022-11-03 04:03:46,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:46,469 INFO L390 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 [2022-11-03 04:03:46,484 INFO L390 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 [2022-11-03 04:03:46,583 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:46,583 INFO L390 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 [2022-11-03 04:03:46,591 INFO L390 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 [2022-11-03 04:03:46,630 INFO L390 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 [2022-11-03 04:03:46,639 INFO L390 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 [2022-11-03 04:03:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-03 04:03:46,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:46,727 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-03 04:03:46,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 04:03:48,106 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7325))) (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~mem39#1.base| v_ArrVal_7324) .cse0 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7324) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 04:03:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424951201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:48,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:03:48,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 18, 46] total 88 [2022-11-03 04:03:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717708310] [2022-11-03 04:03:48,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:48,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-03 04:03:48,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-03 04:03:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=573, Unknown=106, NotChecked=9000, Total=9900 [2022-11-03 04:03:48,129 INFO L87 Difference]: Start difference. First operand 4906 states and 7258 transitions. Second operand has 89 states, 86 states have (on average 3.255813953488372) internal successors, (280), 89 states have internal predecessors, (280), 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) [2022-11-03 04:03:49,667 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6673) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146))) (exists ((v_ArrVal_6149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6149))) (exists ((v_ArrVal_6111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6111) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6683))) (exists ((v_ArrVal_6110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6110))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6671) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7147))) (exists ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6108) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183))) (exists ((v_ArrVal_6171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6699))) (exists ((v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6182))) (exists ((v_ArrVal_6137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6137))) (exists ((v_ArrVal_6117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6117))) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6121))) (exists ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6128) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_6183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6183))) (exists ((v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6670))) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_6120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6141))) (exists ((v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6189))) (exists ((v_ArrVal_6140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6140))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_ArrVal_6156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6156) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6689))) (exists ((v_ArrVal_6129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6129))) (exists ((v_ArrVal_6116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6116) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6157))) (exists ((v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6188))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_6144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6144))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6711))) (exists ((v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6175))) (exists ((v_ArrVal_6148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6148)))) is different from true [2022-11-03 04:03:49,692 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6673) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6112))) (exists ((v_ArrVal_6149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6149))) (exists ((v_ArrVal_6111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6111) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6683))) (exists ((v_ArrVal_6110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6110))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6671) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7225))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6108) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7224) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6190))) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183))) (exists ((v_ArrVal_6151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6151))) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6171) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7203) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6699))) (exists ((v_ArrVal_6113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6113))) (exists ((v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6136) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6182))) (exists ((v_ArrVal_6137 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6137))) (exists ((v_ArrVal_6117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6117))) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_ArrVal_6121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6121))) (exists ((v_ArrVal_6174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6174) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6128) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6176))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194))) (exists ((v_ArrVal_6183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6183))) (exists ((v_ArrVal_6122 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6122) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6702) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6670))) (exists ((v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149))) (exists ((v_ArrVal_6159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_ArrVal_6150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6141 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6141))) (exists ((v_ArrVal_6189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6189))) (exists ((v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7178))) (exists ((v_ArrVal_6140 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6140))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_ArrVal_6156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6156) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6123 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6123))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6191) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_6689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6689))) (exists ((v_ArrVal_6129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6129))) (exists ((v_ArrVal_6116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6116) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6157))) (exists ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7205) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6188))) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_6144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6144))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6711))) (exists ((v_ArrVal_6175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6175))) (exists ((v_ArrVal_6148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6148)))) is different from true [2022-11-03 04:03:50,016 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6108) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6109) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6670))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 04:04:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:31,953 INFO L93 Difference]: Finished difference Result 18901 states and 29056 transitions. [2022-11-03 04:04:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 04:04:31,954 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 86 states have (on average 3.255813953488372) internal successors, (280), 89 states have internal predecessors, (280), 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 122 [2022-11-03 04:04:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:31,978 INFO L225 Difference]: With dead ends: 18901 [2022-11-03 04:04:31,978 INFO L226 Difference]: Without dead ends: 18901 [2022-11-03 04:04:31,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 223 SyntacticMatches, 69 SemanticMatches, 113 ConstructedPredicates, 78 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=355, Invalid=1148, Unknown=141, NotChecked=11466, Total=13110 [2022-11-03 04:04:31,981 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 8618 mSDsluCounter, 16133 mSDsCounter, 0 mSdLazyCounter, 12327 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8638 SdHoareTripleChecker+Valid, 17527 SdHoareTripleChecker+Invalid, 493451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 12327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481024 IncrementalHoareTripleChecker+Unchecked, 39.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:31,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8638 Valid, 17527 Invalid, 493451 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [100 Valid, 12327 Invalid, 0 Unknown, 481024 Unchecked, 39.8s Time] [2022-11-03 04:04:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18901 states. [2022-11-03 04:04:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18901 to 4905. [2022-11-03 04:04:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4905 states, 4118 states have (on average 1.7396794560466247) internal successors, (7164), 4860 states have internal predecessors, (7164), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 04:04:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 7255 transitions. [2022-11-03 04:04:32,133 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 7255 transitions. Word has length 122 [2022-11-03 04:04:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:32,134 INFO L495 AbstractCegarLoop]: Abstraction has 4905 states and 7255 transitions. [2022-11-03 04:04:32,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 86 states have (on average 3.255813953488372) internal successors, (280), 89 states have internal predecessors, (280), 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) [2022-11-03 04:04:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 7255 transitions. [2022-11-03 04:04:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-03 04:04:32,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:32,135 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:32,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:32,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:32,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:32,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:04:32,736 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-11-03 04:04:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2082306569, now seen corresponding path program 1 times [2022-11-03 04:04:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:04:32,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484438849] [2022-11-03 04:04:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:32,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:04:32,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:04:32,739 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:04:32,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-03 04:04:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:34,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 04:04:34,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:34,332 INFO L390 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 7 [2022-11-03 04:04:34,532 INFO L390 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 [2022-11-03 04:04:34,552 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:04:34,552 INFO L390 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 13 treesize of output 13 [2022-11-03 04:04:34,584 INFO L390 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 [2022-11-03 04:04:34,596 INFO L390 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 [2022-11-03 04:04:34,764 INFO L390 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 [2022-11-03 04:04:34,773 INFO L390 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 [2022-11-03 04:04:34,884 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7722) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:34,976 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7727)))) is different from true [2022-11-03 04:04:34,995 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,015 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730)))) is different from true [2022-11-03 04:04:35,034 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,052 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7735 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7735))) (exists ((v_ArrVal_7734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7734))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,070 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,088 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,107 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,126 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,144 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:35,167 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747)))) is different from true [2022-11-03 04:04:35,187 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:35,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750)))) is different from true [2022-11-03 04:04:35,224 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753)))) is different from true [2022-11-03 04:04:35,243 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754)))) is different from true [2022-11-03 04:04:35,262 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:04:35,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:35,306 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761)))) is different from true [2022-11-03 04:04:35,329 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763)))) is different from true [2022-11-03 04:04:35,352 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764)))) is different from true [2022-11-03 04:04:35,376 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:04:35,399 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7769) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:35,422 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770)))) is different from true [2022-11-03 04:04:35,513 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,546 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774))) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775)))) is different from true [2022-11-03 04:04:35,582 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7777))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776)))) is different from true [2022-11-03 04:04:35,605 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778)))) is different from true [2022-11-03 04:04:35,627 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781)))) is different from true [2022-11-03 04:04:35,650 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,672 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,694 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:04:35,720 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788)))) is different from true [2022-11-03 04:04:35,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791)))) is different from true [2022-11-03 04:04:35,801 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792)))) is different from true [2022-11-03 04:04:35,823 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,866 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798)))) is different from true [2022-11-03 04:04:35,888 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:04:35,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802)))) is different from true [2022-11-03 04:04:35,931 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:04:35,950 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807)))) is different from true [2022-11-03 04:04:35,967 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808)))) is different from true [2022-11-03 04:04:36,041 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:36,042 INFO L390 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 [2022-11-03 04:04:36,052 INFO L390 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 [2022-11-03 04:04:36,233 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:36,233 INFO L390 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 [2022-11-03 04:04:36,251 INFO L390 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 [2022-11-03 04:04:36,398 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:36,399 INFO L390 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 [2022-11-03 04:04:36,407 INFO L390 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 [2022-11-03 04:04:36,449 INFO L390 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 [2022-11-03 04:04:36,463 INFO L390 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 [2022-11-03 04:04:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-03 04:04:36,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:36,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-03 04:04:36,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-03 04:04:36,957 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7811))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7810) .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 04:04:37,065 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7811))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7810) .cse1 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7810) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 04:04:39,130 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7905))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7811))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7904) .cse0 v_ArrVal_7810) .cse1 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7905))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7904) .cse6 v_ArrVal_7810) (select (select (store .cse7 .cse6 v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-03 04:04:39,151 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:04:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484438849] [2022-11-03 04:04:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484438849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:39,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637893460] [2022-11-03 04:04:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:39,152 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:04:39,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:04:39,153 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:04:39,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-11-03 04:09:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:21,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 04:09:21,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:21,182 INFO L390 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 7 [2022-11-03 04:09:21,506 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:21,506 INFO L390 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 13 treesize of output 13 [2022-11-03 04:09:21,522 INFO L390 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 [2022-11-03 04:09:21,546 INFO L390 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 [2022-11-03 04:09:21,564 INFO L390 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 [2022-11-03 04:09:21,684 INFO L390 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 [2022-11-03 04:09:21,693 INFO L390 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 [2022-11-03 04:09:21,804 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8303))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8302)))) is different from true [2022-11-03 04:09:21,830 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8305))) (exists ((v_ArrVal_8304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8304)))) is different from true [2022-11-03 04:09:21,856 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8307) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8306)))) is different from true [2022-11-03 04:09:21,883 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8309)))) is different from true [2022-11-03 04:09:21,909 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:21,936 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:09:21,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314)))) is different from true [2022-11-03 04:09:21,991 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8316))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8317)))) is different from true [2022-11-03 04:09:22,019 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:22,045 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8321))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8320) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:22,071 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:22,115 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324)))) is different from true [2022-11-03 04:09:22,142 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8326) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8327)))) is different from true [2022-11-03 04:09:22,168 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329)))) is different from true [2022-11-03 04:09:22,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8331))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8330) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:22,221 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333)))) is different from true [2022-11-03 04:09:22,247 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8334))) (exists ((v_ArrVal_8335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8335)))) is different from true [2022-11-03 04:09:22,273 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8337))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,300 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8338))) (exists ((v_ArrVal_8339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8339) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8341))) (exists ((v_ArrVal_8340 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8340) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,352 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8343))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8342)))) is different from true [2022-11-03 04:09:22,378 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8345))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8344)))) is different from true [2022-11-03 04:09:22,405 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8347))) (exists ((v_ArrVal_8346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8346))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8348))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8349)))) is different from true [2022-11-03 04:09:22,458 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8350))) (exists ((v_ArrVal_8351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8351))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,485 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353)))) is different from true [2022-11-03 04:09:22,511 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354)))) is different from true [2022-11-03 04:09:22,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357)))) is different from true [2022-11-03 04:09:22,630 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,656 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,682 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365)))) is different from true [2022-11-03 04:09:22,708 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366)))) is different from true [2022-11-03 04:09:22,734 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:09:22,761 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,802 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,831 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,858 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:22,886 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:09:22,912 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381)))) is different from true [2022-11-03 04:09:22,939 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382)))) is different from true [2022-11-03 04:09:22,965 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:22,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 04:09:23,018 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:23,112 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:23,112 INFO L390 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 [2022-11-03 04:09:23,140 INFO L390 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 [2022-11-03 04:09:23,303 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:23,304 INFO L390 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 [2022-11-03 04:09:23,316 INFO L390 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 [2022-11-03 04:09:23,437 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:23,438 INFO L390 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 [2022-11-03 04:09:23,461 INFO L390 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 [2022-11-03 04:09:23,525 INFO L390 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 [2022-11-03 04:09:23,541 INFO L390 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 [2022-11-03 04:09:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-03 04:09:23,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:23,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-03 04:09:23,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-03 04:09:23,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8390))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8391) .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8391) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 04:09:23,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8390))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8391) .cse1 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8391) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 04:09:25,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8485))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8484) .cse1 v_ArrVal_8391) (select (select (store .cse2 .cse1 v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8392))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8485))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8390))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8484) .cse4 v_ArrVal_8391) .cse5 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 04:09:25,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1637893460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:25,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816567455] [2022-11-03 04:09:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:25,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:25,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:25,997 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:25,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_925ea5dd-7c46-4e21-95f8-65db3296a80c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-03 04:09:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:26,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-03 04:09:26,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:27,234 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:27,234 INFO L390 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 13 treesize of output 13 [2022-11-03 04:09:27,253 INFO L390 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 [2022-11-03 04:09:27,269 INFO L390 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 [2022-11-03 04:09:27,292 INFO L390 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 [2022-11-03 04:09:27,408 INFO L390 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 [2022-11-03 04:09:27,416 INFO L390 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 [2022-11-03 04:09:27,529 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8881))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8882)))) is different from true [2022-11-03 04:09:27,556 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8883) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8884)))) is different from true [2022-11-03 04:09:27,584 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886)))) is different from true [2022-11-03 04:09:27,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887)))) is different from true [2022-11-03 04:09:27,664 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8889))) (exists ((v_ArrVal_8890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8890) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 04:09:27,693 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892)))) is different from true [2022-11-03 04:09:27,720 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8894))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8893) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 04:09:27,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8895) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8896 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8896) |c_#memory_$Pointer$.offset|))) is different from true