./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW --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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- 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-4e7fbc6 [2022-11-23 14:58:09,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:58:09,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:58:09,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:58:09,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:58:09,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:58:09,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:58:09,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:58:09,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:58:09,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:58:09,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:58:09,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:58:09,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:58:09,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:58:09,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:58:09,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:58:09,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:58:09,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:58:09,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:58:09,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:58:09,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:58:09,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:58:09,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:58:09,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:58:09,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:58:09,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:58:09,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:58:09,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:58:09,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:58:09,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:58:09,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:58:09,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:58:09,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:58:09,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:58:09,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:58:09,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:58:09,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:58:09,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:58:09,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:58:09,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:58:09,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:58:09,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:58:09,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:58:09,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:58:09,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:58:09,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:58:09,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:58:09,344 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:58:09,344 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:58:09,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:58:09,345 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:58:09,345 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:58:09,345 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:58:09,346 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:58:09,346 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:58:09,346 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:58:09,347 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:58:09,347 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:58:09,347 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:58:09,348 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:58:09,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:58:09,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:58:09,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:58:09,350 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:58:09,350 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:58:09,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:58:09,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:58:09,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:58:09,351 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:58:09,352 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:58:09,352 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:58:09,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:58:09,353 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:58:09,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:58:09,353 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:58:09,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:58:09,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:58:09,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:58:09,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:58:09,355 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:58:09,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:58:09,356 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:58:09,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:58:09,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:58:09,357 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2022-11-23 14:58:09,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:58:09,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:58:09,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:58:09,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:58:09,739 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:58:09,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2022-11-23 14:58:13,036 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:58:13,402 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:58:13,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2022-11-23 14:58:13,422 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/0ae409b1a/641fb9d379a94c259c121a0ea6869fc9/FLAG87d462485 [2022-11-23 14:58:13,440 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/0ae409b1a/641fb9d379a94c259c121a0ea6869fc9 [2022-11-23 14:58:13,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:58:13,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:58:13,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:58:13,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:58:13,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:58:13,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:13" (1/1) ... [2022-11-23 14:58:13,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3533f1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:13, skipping insertion in model container [2022-11-23 14:58:13,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:13" (1/1) ... [2022-11-23 14:58:13,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:58:13,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:58:14,129 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[33021,33034] [2022-11-23 14:58:14,293 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[45234,45247] [2022-11-23 14:58:14,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:58:14,331 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-23 14:58:14,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@156e3464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:14, skipping insertion in model container [2022-11-23 14:58:14,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:58:14,343 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 14:58:14,345 INFO L158 Benchmark]: Toolchain (without parser) took 899.57ms. Allocated memory is still 190.8MB. Free memory was 153.7MB in the beginning and 147.3MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 14:58:14,346 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:58:14,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 890.53ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 147.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 14:58:14,348 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.30ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 890.53ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 147.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW --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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- 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-4e7fbc6 [2022-11-23 14:58:16,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:58:16,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:58:16,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:58:16,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:58:16,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:58:16,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:58:16,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:58:16,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:58:16,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:58:16,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:58:16,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:58:16,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:58:16,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:58:16,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:58:16,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:58:16,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:58:16,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:58:16,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:58:16,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:58:16,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:58:16,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:58:16,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:58:16,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:58:16,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:58:16,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:58:16,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:58:16,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:58:16,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:58:16,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:58:16,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:58:16,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:58:16,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:58:16,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:58:16,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:58:16,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:58:16,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:58:16,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:58:16,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:58:16,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:58:16,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:58:16,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 14:58:16,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:58:16,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:58:16,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:58:17,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:58:17,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:58:17,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:58:17,003 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:58:17,005 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:58:17,006 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:58:17,006 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:58:17,006 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:58:17,006 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:58:17,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:58:17,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:58:17,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:58:17,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:58:17,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:58:17,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:58:17,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:58:17,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:58:17,010 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:58:17,010 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:58:17,011 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:58:17,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:58:17,011 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:58:17,011 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:58:17,012 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:58:17,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:58:17,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:58:17,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:58:17,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:58:17,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:58:17,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:58:17,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:58:17,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:58:17,014 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:58:17,014 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:58:17,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:58:17,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:58:17,015 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/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_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2022-11-23 14:58:17,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:58:17,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:58:17,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:58:17,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:58:17,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:58:17,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2022-11-23 14:58:21,071 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:58:21,453 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:58:21,454 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2022-11-23 14:58:21,478 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/d4e991bac/5fc500f8c6ab4748bf5857f4dc30900a/FLAG33de90bf9 [2022-11-23 14:58:21,500 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/data/d4e991bac/5fc500f8c6ab4748bf5857f4dc30900a [2022-11-23 14:58:21,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:58:21,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:58:21,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:58:21,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:58:21,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:58:21,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:21" (1/1) ... [2022-11-23 14:58:21,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b98381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:21, skipping insertion in model container [2022-11-23 14:58:21,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:21" (1/1) ... [2022-11-23 14:58:21,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:58:21,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:58:22,113 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[33021,33034] [2022-11-23 14:58:22,316 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[45234,45247] [2022-11-23 14:58:22,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:58:22,349 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 14:58:22,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:58:22,386 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[33021,33034] [2022-11-23 14:58:22,447 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[45234,45247] [2022-11-23 14:58:22,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:58:22,478 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:58:22,508 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[33021,33034] [2022-11-23 14:58:22,596 WARN L237 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_6fd362c5-d10c-4a1b-b148-127cb14a0582/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i[45234,45247] [2022-11-23 14:58:22,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:58:22,656 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:58:22,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22 WrapperNode [2022-11-23 14:58:22,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:58:22,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:58:22,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:58:22,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:58:22,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,774 INFO L138 Inliner]: procedures = 180, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1171 [2022-11-23 14:58:22,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:58:22,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:58:22,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:58:22,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:58:22,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:58:22,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:58:22,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:58:22,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:58:22,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2022-11-23 14:58:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:58:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:58:22,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:58:23,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:58:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 14:58:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 14:58:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 14:58:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 14:58:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 14:58:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 14:58:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-11-23 14:58:23,071 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-11-23 14:58:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:58:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:58:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:58:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:58:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 14:58:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:58:23,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:58:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 14:58:23,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:58:23,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:58:23,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:58:23,424 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:58:23,426 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:58:23,451 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 14:58:30,076 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:58:30,091 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:58:30,092 INFO L300 CfgBuilder]: Removed 71 assume(true) statements. [2022-11-23 14:58:30,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:30 BoogieIcfgContainer [2022-11-23 14:58:30,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:58:30,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:58:30,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:58:30,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:58:30,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:58:21" (1/3) ... [2022-11-23 14:58:30,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35adf5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:30, skipping insertion in model container [2022-11-23 14:58:30,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (2/3) ... [2022-11-23 14:58:30,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35adf5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:30, skipping insertion in model container [2022-11-23 14:58:30,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:30" (3/3) ... [2022-11-23 14:58:30,105 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-2.i [2022-11-23 14:58:30,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:58:30,126 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 641 error locations. [2022-11-23 14:58:30,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:58:30,198 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;@9eae898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:58:30,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 641 error locations. [2022-11-23 14:58:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 1295 states, 633 states have (on average 2.2543443917851502) internal successors, (1427), 1286 states have internal predecessors, (1427), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-23 14:58:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:58:30,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:30,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:58:30,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-11-23 14:58:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:30,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338395586] [2022-11-23 14:58:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:30,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:30,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 14:58:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:30,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:58:30,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:30,598 INFO L350 Elim1Store]: Elim1 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-23 14:58:30,642 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-23 14:58:30,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:30,643 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338395586] [2022-11-23 14:58:30,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338395586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:30,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:30,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:58:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188951910] [2022-11-23 14:58:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:30,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:30,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:30,722 INFO L87 Difference]: Start difference. First operand has 1295 states, 633 states have (on average 2.2543443917851502) internal successors, (1427), 1286 states have internal predecessors, (1427), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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-23 14:58:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:33,978 INFO L93 Difference]: Finished difference Result 1475 states and 1580 transitions. [2022-11-23 14:58:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:33,982 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-23 14:58:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:34,006 INFO L225 Difference]: With dead ends: 1475 [2022-11-23 14:58:34,006 INFO L226 Difference]: Without dead ends: 1473 [2022-11-23 14:58:34,008 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-23 14:58:34,012 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 1160 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:34,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1046 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 14:58:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-11-23 14:58:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1284. [2022-11-23 14:58:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 636 states have (on average 2.111635220125786) internal successors, (1343), 1274 states have internal predecessors, (1343), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 14:58:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1385 transitions. [2022-11-23 14:58:34,139 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1385 transitions. Word has length 3 [2022-11-23 14:58:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:34,139 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 1385 transitions. [2022-11-23 14:58:34,140 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-23 14:58:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1385 transitions. [2022-11-23 14:58:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:58:34,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:34,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:58:34,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-23 14:58:34,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:34,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-11-23 14:58:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:34,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37248367] [2022-11-23 14:58:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:34,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:34,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:34,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 14:58:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:34,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:58:34,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:34,562 INFO L350 Elim1Store]: Elim1 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-23 14:58:34,579 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-23 14:58:34,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:34,583 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37248367] [2022-11-23 14:58:34,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37248367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:34,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:34,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:58:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18593304] [2022-11-23 14:58:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:34,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:34,587 INFO L87 Difference]: Start difference. First operand 1284 states and 1385 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-23 14:58:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:39,880 INFO L93 Difference]: Finished difference Result 1876 states and 2018 transitions. [2022-11-23 14:58:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:39,881 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-23 14:58:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:39,888 INFO L225 Difference]: With dead ends: 1876 [2022-11-23 14:58:39,889 INFO L226 Difference]: Without dead ends: 1876 [2022-11-23 14:58:39,889 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-23 14:58:39,890 INFO L413 NwaCegarLoop]: 1088 mSDtfsCounter, 631 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:39,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1836 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-23 14:58:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-11-23 14:58:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1488. [2022-11-23 14:58:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 840 states have (on average 2.0976190476190477) internal successors, (1762), 1477 states have internal predecessors, (1762), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 14:58:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1806 transitions. [2022-11-23 14:58:39,938 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1806 transitions. Word has length 3 [2022-11-23 14:58:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:39,939 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1806 transitions. [2022-11-23 14:58:39,939 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-23 14:58:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1806 transitions. [2022-11-23 14:58:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:58:39,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:39,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:39,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:40,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:40,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-11-23 14:58:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794708651] [2022-11-23 14:58:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:40,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:40,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:40,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 14:58:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:40,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:58:40,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:40,378 INFO L350 Elim1Store]: Elim1 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-23 14:58:40,386 INFO L350 Elim1Store]: Elim1 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-23 14:58:40,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:58:40,480 INFO L350 Elim1Store]: Elim1 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-23 14:58:40,513 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:58:40,515 INFO L350 Elim1Store]: Elim1 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-23 14:58:40,558 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-23 14:58:40,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:40,558 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794708651] [2022-11-23 14:58:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794708651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:40,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:40,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:58:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141234709] [2022-11-23 14:58:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:58:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:58:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:58:40,569 INFO L87 Difference]: Start difference. First operand 1488 states and 1806 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-23 14:58:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:45,821 INFO L93 Difference]: Finished difference Result 1670 states and 1995 transitions. [2022-11-23 14:58:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:58:45,822 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-23 14:58:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:45,828 INFO L225 Difference]: With dead ends: 1670 [2022-11-23 14:58:45,829 INFO L226 Difference]: Without dead ends: 1670 [2022-11-23 14:58:45,829 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-23 14:58:45,830 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 2604 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:45,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 643 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-23 14:58:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-11-23 14:58:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1273. [2022-11-23 14:58:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 636 states have (on average 2.092767295597484) internal successors, (1331), 1263 states have internal predecessors, (1331), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 14:58:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1373 transitions. [2022-11-23 14:58:45,880 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1373 transitions. Word has length 7 [2022-11-23 14:58:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:45,880 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1373 transitions. [2022-11-23 14:58:45,881 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-23 14:58:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1373 transitions. [2022-11-23 14:58:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:58:45,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:45,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:45,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:46,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:46,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-11-23 14:58:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:46,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864496023] [2022-11-23 14:58:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:46,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:46,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 14:58:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:46,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:58:46,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:46,311 INFO L350 Elim1Store]: Elim1 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-23 14:58:46,330 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-23 14:58:46,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:46,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:46,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864496023] [2022-11-23 14:58:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864496023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:46,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:46,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:58:46,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38880124] [2022-11-23 14:58:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:46,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:46,341 INFO L87 Difference]: Start difference. First operand 1273 states and 1373 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-23 14:58:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:49,366 INFO L93 Difference]: Finished difference Result 1600 states and 1727 transitions. [2022-11-23 14:58:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:49,367 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-23 14:58:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:49,374 INFO L225 Difference]: With dead ends: 1600 [2022-11-23 14:58:49,374 INFO L226 Difference]: Without dead ends: 1600 [2022-11-23 14:58:49,375 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-23 14:58:49,376 INFO L413 NwaCegarLoop]: 1202 mSDtfsCounter, 986 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:49,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1608 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-23 14:58:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-11-23 14:58:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1226. [2022-11-23 14:58:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 636 states have (on average 2.0172955974842766) internal successors, (1283), 1216 states have internal predecessors, (1283), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 14:58:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1325 transitions. [2022-11-23 14:58:49,412 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1325 transitions. Word has length 8 [2022-11-23 14:58:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:49,413 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1325 transitions. [2022-11-23 14:58:49,413 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-23 14:58:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1325 transitions. [2022-11-23 14:58:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:58:49,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:49,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:49,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:49,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:49,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-11-23 14:58:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:49,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902672599] [2022-11-23 14:58:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:49,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:49,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 14:58:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:49,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:58:49,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:49,832 INFO L350 Elim1Store]: Elim1 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-23 14:58:49,863 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-23 14:58:49,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:49,864 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902672599] [2022-11-23 14:58:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902672599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:49,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:49,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:58:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992201335] [2022-11-23 14:58:49,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:49,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:49,867 INFO L87 Difference]: Start difference. First operand 1226 states and 1325 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-23 14:58:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:54,371 INFO L93 Difference]: Finished difference Result 1693 states and 1826 transitions. [2022-11-23 14:58:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:54,380 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-23 14:58:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:54,387 INFO L225 Difference]: With dead ends: 1693 [2022-11-23 14:58:54,388 INFO L226 Difference]: Without dead ends: 1693 [2022-11-23 14:58:54,388 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-23 14:58:54,390 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 684 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:54,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2006 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-23 14:58:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2022-11-23 14:58:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1468. [2022-11-23 14:58:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 886 states have (on average 2.005643340857788) internal successors, (1777), 1456 states have internal predecessors, (1777), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 14:58:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1823 transitions. [2022-11-23 14:58:54,438 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1823 transitions. Word has length 8 [2022-11-23 14:58:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:54,439 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 1823 transitions. [2022-11-23 14:58:54,440 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-23 14:58:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1823 transitions. [2022-11-23 14:58:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:58:54,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:54,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:54,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:54,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1078263803, now seen corresponding path program 1 times [2022-11-23 14:58:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407516109] [2022-11-23 14:58:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:54,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:54,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:54,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 14:58:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:54,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:58:54,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:54,967 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-23 14:58:54,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:54,968 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407516109] [2022-11-23 14:58:54,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407516109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:54,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:54,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:58:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858770107] [2022-11-23 14:58:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:54,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:54,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:54,976 INFO L87 Difference]: Start difference. First operand 1468 states and 1823 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-23 14:58:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:55,571 INFO L93 Difference]: Finished difference Result 2285 states and 2858 transitions. [2022-11-23 14:58:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:55,572 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-23 14:58:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:55,581 INFO L225 Difference]: With dead ends: 2285 [2022-11-23 14:58:55,581 INFO L226 Difference]: Without dead ends: 2285 [2022-11-23 14:58:55,582 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-23 14:58:55,583 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 748 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:55,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2559 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:58:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2022-11-23 14:58:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1868. [2022-11-23 14:58:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1284 states have (on average 1.9883177570093458) internal successors, (2553), 1854 states have internal predecessors, (2553), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:58:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2603 transitions. [2022-11-23 14:58:55,638 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2603 transitions. Word has length 11 [2022-11-23 14:58:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:55,638 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2603 transitions. [2022-11-23 14:58:55,638 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-23 14:58:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2603 transitions. [2022-11-23 14:58:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:58:55,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:55,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:55,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:55,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:55,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 539494683, now seen corresponding path program 1 times [2022-11-23 14:58:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:55,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767691963] [2022-11-23 14:58:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:55,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:55,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:55,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 14:58:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:56,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:58:56,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:56,051 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-23 14:58:56,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:56,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767691963] [2022-11-23 14:58:56,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767691963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:56,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:56,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:58:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96158005] [2022-11-23 14:58:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:56,054 INFO L87 Difference]: Start difference. First operand 1868 states and 2603 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:58:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:56,099 INFO L93 Difference]: Finished difference Result 1991 states and 2663 transitions. [2022-11-23 14:58:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:58:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:56,109 INFO L225 Difference]: With dead ends: 1991 [2022-11-23 14:58:56,109 INFO L226 Difference]: Without dead ends: 1991 [2022-11-23 14:58:56,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 14:58:56,110 INFO L413 NwaCegarLoop]: 1460 mSDtfsCounter, 585 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2348 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-23 14:58:56,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2348 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:58:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-11-23 14:58:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1772. [2022-11-23 14:58:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1212 states have (on average 1.9645214521452146) internal successors, (2381), 1758 states have internal predecessors, (2381), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:58:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2431 transitions. [2022-11-23 14:58:56,160 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2431 transitions. Word has length 13 [2022-11-23 14:58:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:56,161 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2431 transitions. [2022-11-23 14:58:56,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:58:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2431 transitions. [2022-11-23 14:58:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:58:56,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:56,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:56,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-23 14:58:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:56,376 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr639ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 504002993, now seen corresponding path program 1 times [2022-11-23 14:58:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:56,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886875845] [2022-11-23 14:58:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:56,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:56,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:56,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:56,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 14:58:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:58:56,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:56,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:58:56,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:58:56,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:58:56,674 INFO L350 Elim1Store]: Elim1 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-23 14:58:56,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:58:56,752 INFO L350 Elim1Store]: Elim1 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-23 14:58:56,775 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-23 14:58:56,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:56,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886875845] [2022-11-23 14:58:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886875845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:56,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:56,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:58:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757175025] [2022-11-23 14:58:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:56,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:58:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:56,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:58:56,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:58:56,778 INFO L87 Difference]: Start difference. First operand 1772 states and 2431 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 14:58:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:58,874 INFO L93 Difference]: Finished difference Result 2414 states and 3334 transitions. [2022-11-23 14:58:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:58:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-23 14:58:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:58,883 INFO L225 Difference]: With dead ends: 2414 [2022-11-23 14:58:58,883 INFO L226 Difference]: Without dead ends: 2414 [2022-11-23 14:58:58,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-23 14:58:58,884 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 462 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:58:58,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 3524 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 14:58:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-11-23 14:58:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1771. [2022-11-23 14:58:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1211 states have (on average 1.9644921552436003) internal successors, (2379), 1757 states have internal predecessors, (2379), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:58:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2429 transitions. [2022-11-23 14:58:58,939 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2429 transitions. Word has length 14 [2022-11-23 14:58:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:58,940 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2429 transitions. [2022-11-23 14:58:58,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 14:58:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2429 transitions. [2022-11-23 14:58:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:58:58,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:58,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:58:58,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:59,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:59,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-11-23 14:58:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:59,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581087597] [2022-11-23 14:58:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:59,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:59,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:59,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:59,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 14:58:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:58:59,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:58:59,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:58:59,413 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-23 14:58:59,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:58:59,414 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:58:59,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581087597] [2022-11-23 14:58:59,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581087597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:58:59,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:58:59,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:58:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081775702] [2022-11-23 14:58:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:58:59,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:58:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:58:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:58:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:59,418 INFO L87 Difference]: Start difference. First operand 1771 states and 2429 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:58:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:58:59,480 INFO L93 Difference]: Finished difference Result 1711 states and 2343 transitions. [2022-11-23 14:58:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:58:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 14:58:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:58:59,489 INFO L225 Difference]: With dead ends: 1711 [2022-11-23 14:58:59,489 INFO L226 Difference]: Without dead ends: 1711 [2022-11-23 14:58:59,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:58:59,493 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 1129 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1309 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-23 14:58:59,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:58:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2022-11-23 14:58:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1711. [2022-11-23 14:58:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1175 states have (on average 1.9514893617021276) internal successors, (2293), 1697 states have internal predecessors, (2293), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:58:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2343 transitions. [2022-11-23 14:58:59,549 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2343 transitions. Word has length 18 [2022-11-23 14:58:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:58:59,549 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2343 transitions. [2022-11-23 14:58:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:58:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2343 transitions. [2022-11-23 14:58:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:58:59,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:58:59,551 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-23 14:58:59,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:58:59,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:59,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:58:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:58:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-11-23 14:58:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:58:59,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136793334] [2022-11-23 14:58:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:58:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:58:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:58:59,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:58:59,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 14:59:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:00,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:59:00,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:00,050 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-23 14:59:00,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:00,051 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136793334] [2022-11-23 14:59:00,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136793334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:00,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:00,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:59:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546588292] [2022-11-23 14:59:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:00,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:00,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:00,054 INFO L87 Difference]: Start difference. First operand 1711 states and 2343 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:00,142 INFO L93 Difference]: Finished difference Result 1683 states and 2287 transitions. [2022-11-23 14:59:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:59:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 14:59:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:00,149 INFO L225 Difference]: With dead ends: 1683 [2022-11-23 14:59:00,149 INFO L226 Difference]: Without dead ends: 1683 [2022-11-23 14:59:00,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:00,150 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 1110 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:00,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2429 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:59:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-11-23 14:59:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1681. [2022-11-23 14:59:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1159 states have (on average 1.9283865401207938) internal successors, (2235), 1667 states have internal predecessors, (2235), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:59:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2285 transitions. [2022-11-23 14:59:00,189 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2285 transitions. Word has length 20 [2022-11-23 14:59:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:00,190 INFO L495 AbstractCegarLoop]: Abstraction has 1681 states and 2285 transitions. [2022-11-23 14:59:00,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2285 transitions. [2022-11-23 14:59:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:59:00,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:00,191 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] [2022-11-23 14:59:00,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:00,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:00,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-11-23 14:59:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:00,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922555211] [2022-11-23 14:59:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:00,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:00,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:00,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 14:59:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:00,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:59:00,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:00,635 INFO L350 Elim1Store]: Elim1 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-23 14:59:00,741 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-23 14:59:00,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:00,742 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:00,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922555211] [2022-11-23 14:59:00,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922555211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:00,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:00,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:59:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653484969] [2022-11-23 14:59:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:00,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:00,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:00,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:00,744 INFO L87 Difference]: Start difference. First operand 1681 states and 2285 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:04,427 INFO L93 Difference]: Finished difference Result 2540 states and 3550 transitions. [2022-11-23 14:59:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:59:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-23 14:59:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:04,436 INFO L225 Difference]: With dead ends: 2540 [2022-11-23 14:59:04,436 INFO L226 Difference]: Without dead ends: 2540 [2022-11-23 14:59:04,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:04,437 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 2160 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:04,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 1288 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-23 14:59:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-11-23 14:59:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 1677. [2022-11-23 14:59:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1159 states have (on average 1.9214840379637619) internal successors, (2227), 1663 states have internal predecessors, (2227), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:59:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2277 transitions. [2022-11-23 14:59:04,492 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2277 transitions. Word has length 34 [2022-11-23 14:59:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:04,493 INFO L495 AbstractCegarLoop]: Abstraction has 1677 states and 2277 transitions. [2022-11-23 14:59:04,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2277 transitions. [2022-11-23 14:59:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:59:04,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:04,494 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] [2022-11-23 14:59:04,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:04,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:04,709 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-11-23 14:59:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582814850] [2022-11-23 14:59:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:04,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:04,712 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:04,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 14:59:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:04,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:59:04,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:04,957 INFO L350 Elim1Store]: Elim1 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-23 14:59:05,205 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-23 14:59:05,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:05,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582814850] [2022-11-23 14:59:05,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582814850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:05,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:05,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:59:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779163752] [2022-11-23 14:59:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:05,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:05,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:05,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:05,208 INFO L87 Difference]: Start difference. First operand 1677 states and 2277 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:11,201 INFO L93 Difference]: Finished difference Result 2088 states and 2496 transitions. [2022-11-23 14:59:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:59:11,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-23 14:59:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:11,210 INFO L225 Difference]: With dead ends: 2088 [2022-11-23 14:59:11,210 INFO L226 Difference]: Without dead ends: 2088 [2022-11-23 14:59:11,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:11,211 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 1298 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:11,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2781 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-23 14:59:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-11-23 14:59:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1673. [2022-11-23 14:59:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1159 states have (on average 1.91458153580673) internal successors, (2219), 1659 states have internal predecessors, (2219), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:59:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2269 transitions. [2022-11-23 14:59:11,247 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2269 transitions. Word has length 34 [2022-11-23 14:59:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:11,248 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2269 transitions. [2022-11-23 14:59:11,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2269 transitions. [2022-11-23 14:59:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 14:59:11,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:11,249 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] [2022-11-23 14:59:11,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:11,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:11,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash -515146363, now seen corresponding path program 1 times [2022-11-23 14:59:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:11,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094701317] [2022-11-23 14:59:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:11,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:11,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 14:59:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:11,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:59:11,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:11,884 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-23 14:59:11,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:11,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094701317] [2022-11-23 14:59:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094701317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:11,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:11,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:59:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028811930] [2022-11-23 14:59:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:11,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:11,887 INFO L87 Difference]: Start difference. First operand 1673 states and 2269 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-23 14:59:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:11,979 INFO L93 Difference]: Finished difference Result 1661 states and 2249 transitions. [2022-11-23 14:59:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:59:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-23 14:59:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:11,987 INFO L225 Difference]: With dead ends: 1661 [2022-11-23 14:59:11,987 INFO L226 Difference]: Without dead ends: 1661 [2022-11-23 14:59:11,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-23 14:59:11,988 INFO L413 NwaCegarLoop]: 1166 mSDtfsCounter, 1079 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 2407 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:59:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-11-23 14:59:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2022-11-23 14:59:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1147 states have (on average 1.917175239755885) internal successors, (2199), 1647 states have internal predecessors, (2199), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 14:59:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2249 transitions. [2022-11-23 14:59:12,021 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2249 transitions. Word has length 52 [2022-11-23 14:59:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:12,023 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 2249 transitions. [2022-11-23 14:59:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-23 14:59:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2249 transitions. [2022-11-23 14:59:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 14:59:12,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:12,028 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] [2022-11-23 14:59:12,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:12,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:12,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-11-23 14:59:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:12,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424581713] [2022-11-23 14:59:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:12,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:12,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 14:59:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:12,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:59:12,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:12,701 INFO L350 Elim1Store]: Elim1 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-23 14:59:12,712 INFO L350 Elim1Store]: Elim1 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-23 14:59:13,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:59:13,406 INFO L350 Elim1Store]: Elim1 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-23 14:59:13,427 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:59:13,428 INFO L350 Elim1Store]: Elim1 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-23 14:59:13,445 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-23 14:59:13,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:13,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:13,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424581713] [2022-11-23 14:59:13,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424581713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:13,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:13,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:59:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921552142] [2022-11-23 14:59:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:13,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:13,448 INFO L87 Difference]: Start difference. First operand 1661 states and 2249 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:16,611 INFO L93 Difference]: Finished difference Result 1632 states and 2221 transitions. [2022-11-23 14:59:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:59:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-23 14:59:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:16,622 INFO L225 Difference]: With dead ends: 1632 [2022-11-23 14:59:16,623 INFO L226 Difference]: Without dead ends: 1632 [2022-11-23 14:59:16,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:16,623 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 1585 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:16,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 763 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 14:59:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2022-11-23 14:59:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1249. [2022-11-23 14:59:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 778 states have (on average 1.8316195372750643) internal successors, (1425), 1238 states have internal predecessors, (1425), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 14:59:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1469 transitions. [2022-11-23 14:59:16,649 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1469 transitions. Word has length 60 [2022-11-23 14:59:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:16,650 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1469 transitions. [2022-11-23 14:59:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1469 transitions. [2022-11-23 14:59:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 14:59:16,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:16,651 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] [2022-11-23 14:59:16,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:16,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:16,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-11-23 14:59:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:16,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656638989] [2022-11-23 14:59:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:16,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:16,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:16,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 14:59:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:17,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:59:17,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:17,199 INFO L350 Elim1Store]: Elim1 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-23 14:59:17,216 INFO L350 Elim1Store]: Elim1 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-23 14:59:17,285 INFO L350 Elim1Store]: Elim1 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-23 14:59:17,299 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-23 14:59:17,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:17,299 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656638989] [2022-11-23 14:59:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656638989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:17,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:17,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:59:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532979854] [2022-11-23 14:59:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:17,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:59:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:17,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:59:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:17,301 INFO L87 Difference]: Start difference. First operand 1249 states and 1469 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:21,341 INFO L93 Difference]: Finished difference Result 1248 states and 1468 transitions. [2022-11-23 14:59:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:59:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-23 14:59:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:21,345 INFO L225 Difference]: With dead ends: 1248 [2022-11-23 14:59:21,345 INFO L226 Difference]: Without dead ends: 1248 [2022-11-23 14:59:21,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:59:21,346 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 4 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2949 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-23 14:59:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-11-23 14:59:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-11-23 14:59:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 778 states have (on average 1.8303341902313626) internal successors, (1424), 1237 states have internal predecessors, (1424), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 14:59:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1468 transitions. [2022-11-23 14:59:21,391 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1468 transitions. Word has length 65 [2022-11-23 14:59:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1468 transitions. [2022-11-23 14:59:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1468 transitions. [2022-11-23 14:59:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 14:59:21,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:21,393 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] [2022-11-23 14:59:21,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:21,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:21,615 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-11-23 14:59:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:21,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560831424] [2022-11-23 14:59:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:21,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:21,617 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:21,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 14:59:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:59:21,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:21,972 INFO L350 Elim1Store]: Elim1 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-23 14:59:22,006 INFO L350 Elim1Store]: Elim1 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-23 14:59:22,017 INFO L350 Elim1Store]: Elim1 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-23 14:59:22,089 INFO L350 Elim1Store]: Elim1 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-23 14:59:22,098 INFO L350 Elim1Store]: Elim1 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-23 14:59:22,120 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-23 14:59:22,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:22,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:22,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560831424] [2022-11-23 14:59:22,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560831424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:22,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:22,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:59:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149823314] [2022-11-23 14:59:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:22,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:59:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:59:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:22,123 INFO L87 Difference]: Start difference. First operand 1248 states and 1468 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:27,304 INFO L93 Difference]: Finished difference Result 1247 states and 1467 transitions. [2022-11-23 14:59:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:59:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-23 14:59:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:27,309 INFO L225 Difference]: With dead ends: 1247 [2022-11-23 14:59:27,310 INFO L226 Difference]: Without dead ends: 1247 [2022-11-23 14:59:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:59:27,311 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 2 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3010 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-23 14:59:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-11-23 14:59:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2022-11-23 14:59:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 777 states have (on average 1.8314028314028314) internal successors, (1423), 1236 states have internal predecessors, (1423), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-23 14:59:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1467 transitions. [2022-11-23 14:59:27,335 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1467 transitions. Word has length 65 [2022-11-23 14:59:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:27,336 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1467 transitions. [2022-11-23 14:59:27,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:59:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1467 transitions. [2022-11-23 14:59:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 14:59:27,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:27,337 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] [2022-11-23 14:59:27,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:27,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:27,555 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1213339796, now seen corresponding path program 1 times [2022-11-23 14:59:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670661952] [2022-11-23 14:59:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:27,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:27,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:27,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 14:59:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:27,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:59:27,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:27,934 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-23 14:59:27,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:59:27,934 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:27,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670661952] [2022-11-23 14:59:27,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670661952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:59:27,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:59:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:59:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214821963] [2022-11-23 14:59:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:59:27,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:59:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:27,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:59:27,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:59:27,939 INFO L87 Difference]: Start difference. First operand 1247 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:59:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:28,035 INFO L93 Difference]: Finished difference Result 1250 states and 1471 transitions. [2022-11-23 14:59:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:59:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-11-23 14:59:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:28,041 INFO L225 Difference]: With dead ends: 1250 [2022-11-23 14:59:28,045 INFO L226 Difference]: Without dead ends: 1250 [2022-11-23 14:59:28,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:59:28,046 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 2 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:28,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3367 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:59:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-23 14:59:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2022-11-23 14:59:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 779 states have (on average 1.8305519897304237) internal successors, (1426), 1239 states have internal predecessors, (1426), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 14:59:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1471 transitions. [2022-11-23 14:59:28,101 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1471 transitions. Word has length 73 [2022-11-23 14:59:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:28,101 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1471 transitions. [2022-11-23 14:59:28,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:59:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1471 transitions. [2022-11-23 14:59:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-23 14:59:28,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:28,103 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] [2022-11-23 14:59:28,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:28,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:28,304 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1684864279, now seen corresponding path program 1 times [2022-11-23 14:59:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:28,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137498466] [2022-11-23 14:59:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:28,306 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:28,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 14:59:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:28,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:59:28,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:28,787 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-23 14:59:28,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:59:28,918 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-23 14:59:28,918 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:28,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137498466] [2022-11-23 14:59:28,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137498466] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:59:28,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421995149] [2022-11-23 14:59:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:28,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:59:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:59:28,931 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:59:28,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-23 14:59:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:29,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:59:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:29,596 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-23 14:59:29,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:59:29,673 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-23 14:59:29,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1421995149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:59:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435656965] [2022-11-23 14:59:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:59:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:59:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:59:29,683 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:59:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 14:59:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:59:30,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:59:30,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:30,174 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-23 14:59:30,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:59:30,233 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-23 14:59:30,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435656965] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:59:30,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:59:30,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-23 14:59:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146480082] [2022-11-23 14:59:30,238 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:59:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:59:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:59:30,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:59:30,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:59:30,240 INFO L87 Difference]: Start difference. First operand 1250 states and 1471 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:59:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:59:30,503 INFO L93 Difference]: Finished difference Result 1262 states and 1488 transitions. [2022-11-23 14:59:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:59:30,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-23 14:59:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:59:30,509 INFO L225 Difference]: With dead ends: 1262 [2022-11-23 14:59:30,509 INFO L226 Difference]: Without dead ends: 1262 [2022-11-23 14:59:30,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-23 14:59:30,510 INFO L413 NwaCegarLoop]: 1125 mSDtfsCounter, 14 mSDsluCounter, 5601 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6726 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:59:30,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6726 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:59:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-11-23 14:59:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1260. [2022-11-23 14:59:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 788 states have (on average 1.8286802030456852) internal successors, (1441), 1248 states have internal predecessors, (1441), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 14:59:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1486 transitions. [2022-11-23 14:59:30,556 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1486 transitions. Word has length 74 [2022-11-23 14:59:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:59:30,556 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1486 transitions. [2022-11-23 14:59:30,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:59:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1486 transitions. [2022-11-23 14:59:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-23 14:59:30,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:59:30,562 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] [2022-11-23 14:59:30,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:30,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:30,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-23 14:59:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:31,176 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 14:59:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:59:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2040232492, now seen corresponding path program 2 times [2022-11-23 14:59:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:59:31,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524833646] [2022-11-23 14:59:31,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:59:31,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:59:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:59:31,179 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:59:31,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 14:59:31,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:59:31,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:59:31,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:59:31,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:31,974 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-23 14:59:31,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:59:32,271 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-23 14:59:32,272 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:59:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524833646] [2022-11-23 14:59:32,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524833646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:59:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1096649401] [2022-11-23 14:59:32,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:59:32,272 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:59:32,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:59:32,276 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:59:32,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-23 14:59:34,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 14:59:34,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:59:34,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:59:34,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:59:34,295 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-23 14:59:34,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:59:34,397 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-23 14:59:34,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1096649401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:59:34,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140139719] [2022-11-23 14:59:34,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 14:59:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:59:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:59:34,399 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:59:34,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 15:00:12,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:00:12,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:00:12,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:00:12,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:12,339 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:00:12,339 INFO L350 Elim1Store]: Elim1 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-23 15:00:12,386 INFO L350 Elim1Store]: Elim1 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-23 15:00:12,984 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:00:12,985 INFO L350 Elim1Store]: Elim1 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-23 15:00:13,092 INFO L350 Elim1Store]: Elim1 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-23 15:00:13,141 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-23 15:00:13,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:13,315 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 15:00:13,315 INFO L350 Elim1Store]: Elim1 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-23 15:00:13,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1624) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2022-11-23 15:00:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140139719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:00:13,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 15:00:13,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-23 15:00:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178573336] [2022-11-23 15:00:13,333 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 15:00:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 15:00:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:00:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 15:00:13,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-23 15:00:13,335 INFO L87 Difference]: Start difference. First operand 1260 states and 1486 transitions. Second operand has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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-23 15:00:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:00:30,576 INFO L93 Difference]: Finished difference Result 1287 states and 1520 transitions. [2022-11-23 15:00:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 15:00:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-11-23 15:00:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:00:30,580 INFO L225 Difference]: With dead ends: 1287 [2022-11-23 15:00:30,580 INFO L226 Difference]: Without dead ends: 1283 [2022-11-23 15:00:30,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=475, Invalid=2692, Unknown=29, NotChecked=110, Total=3306 [2022-11-23 15:00:30,582 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 1700 mSDsluCounter, 7130 mSDsCounter, 0 mSdLazyCounter, 6803 mSolverCounterSat, 63 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 7790 SdHoareTripleChecker+Invalid, 6873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 6803 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:00:30,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 7790 Invalid, 6873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 6803 Invalid, 7 Unknown, 0 Unchecked, 15.2s Time] [2022-11-23 15:00:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-23 15:00:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1268. [2022-11-23 15:00:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 797 states have (on average 1.821831869510665) internal successors, (1452), 1256 states have internal predecessors, (1452), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:00:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1497 transitions. [2022-11-23 15:00:30,605 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1497 transitions. Word has length 77 [2022-11-23 15:00:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:00:30,606 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1497 transitions. [2022-11-23 15:00:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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-23 15:00:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1497 transitions. [2022-11-23 15:00:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-23 15:00:30,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:00:30,607 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] [2022-11-23 15:00:30,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-23 15:00:30,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 15:00:31,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-23 15:00:31,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 15:00:31,224 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:00:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:00:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 587792973, now seen corresponding path program 1 times [2022-11-23 15:00:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:00:31,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436437337] [2022-11-23 15:00:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:00:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:00:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:00:31,226 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:00:31,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-23 15:00:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:00:31,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 15:00:31,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:31,875 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-23 15:00:31,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:32,724 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-23 15:00:32,725 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:00:32,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436437337] [2022-11-23 15:00:32,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436437337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:00:32,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [413341706] [2022-11-23 15:00:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:00:32,726 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:00:32,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:00:32,732 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:00:32,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-23 15:00:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:00:33,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 15:00:33,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:33,688 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-23 15:00:33,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:33,912 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-23 15:00:33,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [413341706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:00:33,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570631509] [2022-11-23 15:00:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:00:33,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:00:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:00:33,916 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:00:33,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 15:00:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:00:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:00:34,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:34,570 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-23 15:00:34,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:35,980 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-23 15:00:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570631509] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:00:35,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 15:00:35,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-23 15:00:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613869267] [2022-11-23 15:00:35,981 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 15:00:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 15:00:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:00:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 15:00:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 15:00:35,983 INFO L87 Difference]: Start difference. First operand 1268 states and 1497 transitions. Second operand has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 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-23 15:00:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:00:40,494 INFO L93 Difference]: Finished difference Result 1310 states and 1554 transitions. [2022-11-23 15:00:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-23 15:00:40,495 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 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 83 [2022-11-23 15:00:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:00:40,498 INFO L225 Difference]: With dead ends: 1310 [2022-11-23 15:00:40,498 INFO L226 Difference]: Without dead ends: 1304 [2022-11-23 15:00:40,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-11-23 15:00:40,500 INFO L413 NwaCegarLoop]: 1132 mSDtfsCounter, 184 mSDsluCounter, 13541 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 14673 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:00:40,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 14673 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 15:00:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-23 15:00:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1286. [2022-11-23 15:00:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 815 states have (on average 1.8098159509202454) internal successors, (1475), 1274 states have internal predecessors, (1475), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:00:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1520 transitions. [2022-11-23 15:00:40,524 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1520 transitions. Word has length 83 [2022-11-23 15:00:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:00:40,525 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1520 transitions. [2022-11-23 15:00:40,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 38 states have internal predecessors, (108), 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-23 15:00:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1520 transitions. [2022-11-23 15:00:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-23 15:00:40,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:00:40,526 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] [2022-11-23 15:00:40,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-23 15:00:40,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-23 15:00:40,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 15:00:41,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:00:41,135 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:00:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:00:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1933948275, now seen corresponding path program 2 times [2022-11-23 15:00:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:00:41,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785700874] [2022-11-23 15:00:41,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:00:41,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:00:41,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:00:41,138 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:00:41,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-23 15:00:41,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:00:41,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:00:41,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 15:00:41,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:42,513 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-23 15:00:42,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:45,347 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-23 15:00:45,347 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:00:45,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785700874] [2022-11-23 15:00:45,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785700874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:00:45,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603503656] [2022-11-23 15:00:45,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:00:45,348 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:00:45,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:00:45,356 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:00:45,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-23 15:00:47,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:00:47,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:00:47,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 15:00:47,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:00:47,734 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-23 15:00:47,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:00:48,351 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-23 15:00:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [603503656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:00:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322595330] [2022-11-23 15:00:48,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:00:48,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:00:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:00:48,353 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:00:48,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 15:01:01,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:01:01,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:01:01,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-23 15:01:01,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:01:01,623 INFO L350 Elim1Store]: Elim1 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-23 15:01:01,638 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:01:01,639 INFO L350 Elim1Store]: Elim1 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-23 15:01:01,795 INFO L350 Elim1Store]: Elim1 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-23 15:01:01,810 INFO L350 Elim1Store]: Elim1 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-23 15:01:02,280 INFO L350 Elim1Store]: Elim1 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-23 15:01:02,288 INFO L350 Elim1Store]: Elim1 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-23 15:01:02,501 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2837))) (exists ((v_ArrVal_2836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2836)))) is different from true [2022-11-23 15:01:02,520 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2839))) (exists ((v_ArrVal_2838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2838)))) is different from true [2022-11-23 15:01:02,538 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2840) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2841 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2841) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:01:02,776 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845)))) is different from true [2022-11-23 15:01:02,795 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846)))) is different from true [2022-11-23 15:01:02,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850)))) is different from true [2022-11-23 15:01:03,007 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-11-23 15:01:03,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-11-23 15:01:03,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856)))) is different from true [2022-11-23 15:01:03,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:01:03,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861)))) is different from true [2022-11-23 15:01:03,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862)))) is different from true [2022-11-23 15:01:03,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:01:03,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:01:03,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877)))) is different from true [2022-11-23 15:01:03,806 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879)))) is different from true [2022-11-23 15:01:03,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:01:03,861 INFO L350 Elim1Store]: Elim1 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-23 15:01:03,878 INFO L350 Elim1Store]: Elim1 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-23 15:01:04,112 INFO L350 Elim1Store]: Elim1 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-23 15:01:04,120 INFO L350 Elim1Store]: Elim1 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-23 15:01:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 232 not checked. [2022-11-23 15:01:04,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:01:05,294 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 15:01:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322595330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:01:05,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-23 15:01:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 25] total 74 [2022-11-23 15:01:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403345499] [2022-11-23 15:01:05,307 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-23 15:01:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-23 15:01:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:01:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-23 15:01:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2833, Unknown=45, NotChecked=2244, Total=5852 [2022-11-23 15:01:05,309 INFO L87 Difference]: Start difference. First operand 1286 states and 1520 transitions. Second operand has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 74 states have internal predecessors, (196), 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-23 15:01:21,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2842) |c_#memory_$Pointer$.base|)) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879)))) is different from true [2022-11-23 15:01:43,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_22) (_ bv44 32))) (exists ((v_ArrVal_2842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2842) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878))) (exists ((v_ArrVal_2843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2843) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879)))) is different from true [2022-11-23 15:02:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:50,083 INFO L93 Difference]: Finished difference Result 2186 states and 2649 transitions. [2022-11-23 15:02:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-11-23 15:02:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 74 states have internal predecessors, (196), 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 95 [2022-11-23 15:02:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:50,089 INFO L225 Difference]: With dead ends: 2186 [2022-11-23 15:02:50,090 INFO L226 Difference]: Without dead ends: 2174 [2022-11-23 15:02:50,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 394 SyntacticMatches, 7 SemanticMatches, 179 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=3924, Invalid=22136, Unknown=98, NotChecked=6422, Total=32580 [2022-11-23 15:02:50,099 INFO L413 NwaCegarLoop]: 1116 mSDtfsCounter, 2404 mSDsluCounter, 31362 mSDsCounter, 0 mSdLazyCounter, 29346 mSolverCounterSat, 426 mSolverCounterUnsat, 586 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 32478 SdHoareTripleChecker+Invalid, 50443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 29346 IncrementalHoareTripleChecker+Invalid, 586 IncrementalHoareTripleChecker+Unknown, 20085 IncrementalHoareTripleChecker+Unchecked, 71.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:50,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 32478 Invalid, 50443 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [426 Valid, 29346 Invalid, 586 Unknown, 20085 Unchecked, 71.3s Time] [2022-11-23 15:02:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2022-11-23 15:02:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 1319. [2022-11-23 15:02:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 849 states have (on average 1.7856301531213192) internal successors, (1516), 1307 states have internal predecessors, (1516), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:02:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1561 transitions. [2022-11-23 15:02:50,137 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1561 transitions. Word has length 95 [2022-11-23 15:02:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:50,138 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1561 transitions. [2022-11-23 15:02:50,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 74 states have internal predecessors, (196), 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-23 15:02:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1561 transitions. [2022-11-23 15:02:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-23 15:02:50,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:50,140 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] [2022-11-23 15:02:50,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:50,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:50,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:50,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:50,763 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:02:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1716367272, now seen corresponding path program 1 times [2022-11-23 15:02:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:02:50,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126940257] [2022-11-23 15:02:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:50,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:02:50,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:02:50,765 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:02:50,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-23 15:02:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:51,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 15:02:51,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:51,888 INFO L350 Elim1Store]: Elim1 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-23 15:02:52,057 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 15:02:52,057 INFO L350 Elim1Store]: Elim1 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-23 15:02:52,086 INFO L350 Elim1Store]: Elim1 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-23 15:02:52,193 INFO L350 Elim1Store]: Elim1 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-23 15:02:52,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (and (not (= v_arrayElimCell_30 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_30))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3320)))) is different from true [2022-11-23 15:02:53,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (and (not (= v_arrayElimCell_30 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_30))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3341) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:02:54,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (and (not (= v_arrayElimCell_30 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_30))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3349) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:02:54,236 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:02:54,236 INFO L350 Elim1Store]: Elim1 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-23 15:02:54,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:02:54,406 INFO L350 Elim1Store]: Elim1 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-23 15:02:54,438 INFO L350 Elim1Store]: Elim1 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-23 15:02:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-23 15:02:54,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:54,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_3351) |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-23 15:02:54,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (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_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 15:02:54,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3351 (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~mem38#1.base| v_ArrVal_3397))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3351)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 15:02:54,995 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:02:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126940257] [2022-11-23 15:02:54,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126940257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [77469795] [2022-11-23 15:02:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:02:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:02:54,998 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:02:55,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-23 15:02:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:59,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 15:02:59,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:59,949 INFO L350 Elim1Store]: Elim1 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-23 15:03:00,114 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 15:03:00,114 INFO L350 Elim1Store]: Elim1 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-23 15:03:00,146 INFO L350 Elim1Store]: Elim1 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-23 15:03:00,242 INFO L350 Elim1Store]: Elim1 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-23 15:03:02,508 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:02,509 INFO L350 Elim1Store]: Elim1 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-23 15:03:02,591 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:02,591 INFO L350 Elim1Store]: Elim1 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-23 15:03:02,623 INFO L350 Elim1Store]: Elim1 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-23 15:03:02,634 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-23 15:03:02,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:04,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3821 (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_3821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 15:03:05,118 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3821 (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~mem38#1.base| v_ArrVal_3867))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:03:05,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [77469795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:05,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114265386] [2022-11-23 15:03:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:05,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:03:05,123 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:03:05,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 15:03:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:05,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 15:03:05,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:06,138 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:03:06,138 INFO L350 Elim1Store]: Elim1 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-23 15:03:06,183 INFO L350 Elim1Store]: Elim1 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-23 15:03:09,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:09,062 INFO L350 Elim1Store]: Elim1 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-23 15:03:09,285 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:09,286 INFO L350 Elim1Store]: Elim1 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-23 15:03:09,310 INFO L350 Elim1Store]: Elim1 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-23 15:03:09,315 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-23 15:03:09,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:09,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4289) |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-23 15:03:09,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_4289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:03:09,794 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-23 15:03:09,794 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 36 [2022-11-23 15:03:09,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem38#1.base| (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~mem38#1.base| v_ArrVal_4335))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4289)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2022-11-23 15:03:09,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114265386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:09,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:03:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 12] total 22 [2022-11-23 15:03:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879740707] [2022-11-23 15:03:09,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:03:09,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 15:03:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:03:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 15:03:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=382, Unknown=32, NotChecked=550, Total=1056 [2022-11-23 15:03:09,814 INFO L87 Difference]: Start difference. First operand 1319 states and 1561 transitions. Second operand has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:03:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:03:31,237 INFO L93 Difference]: Finished difference Result 1327 states and 1569 transitions. [2022-11-23 15:03:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 15:03:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2022-11-23 15:03:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:03:31,240 INFO L225 Difference]: With dead ends: 1327 [2022-11-23 15:03:31,241 INFO L226 Difference]: Without dead ends: 1327 [2022-11-23 15:03:31,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 218 SyntacticMatches, 131 SemanticMatches, 41 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=179, Invalid=814, Unknown=43, NotChecked=770, Total=1806 [2022-11-23 15:03:31,242 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 1624 mSDsluCounter, 4967 mSDsCounter, 0 mSdLazyCounter, 5493 mSolverCounterSat, 30 mSolverCounterUnsat, 872 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 5626 SdHoareTripleChecker+Invalid, 9812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5493 IncrementalHoareTripleChecker+Invalid, 872 IncrementalHoareTripleChecker+Unknown, 3417 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:03:31,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 5626 Invalid, 9812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5493 Invalid, 872 Unknown, 3417 Unchecked, 20.6s Time] [2022-11-23 15:03:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-11-23 15:03:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1318. [2022-11-23 15:03:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 849 states have (on average 1.784452296819788) internal successors, (1515), 1306 states have internal predecessors, (1515), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:03:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1560 transitions. [2022-11-23 15:03:31,264 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1560 transitions. Word has length 120 [2022-11-23 15:03:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:03:31,264 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1560 transitions. [2022-11-23 15:03:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:03:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1560 transitions. [2022-11-23 15:03:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-23 15:03:31,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:03:31,266 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] [2022-11-23 15:03:31,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-23 15:03:31,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-23 15:03:31,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-11-23 15:03:31,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:31,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:03:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:03:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1716367271, now seen corresponding path program 1 times [2022-11-23 15:03:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:03:31,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996601936] [2022-11-23 15:03:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:03:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:03:31,882 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:03:31,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-23 15:03:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:32,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 15:03:33,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:33,013 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,153 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:03:33,153 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,163 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,193 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,206 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,352 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,358 INFO L350 Elim1Store]: Elim1 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-23 15:03:33,485 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719))) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,500 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,530 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,545 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,608 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:03:33,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,714 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:03:33,776 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756))) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:33,850 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,076 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,177 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:03:34,192 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4787))) (exists ((v_ArrVal_4788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4788) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4789))) (exists ((v_ArrVal_4790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4790))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,252 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,308 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4795))) (exists ((v_ArrVal_4796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4796))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,364 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4802))) (exists ((v_ArrVal_4801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4801))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:34,488 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:34,489 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,505 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,652 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:34,652 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,660 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,698 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,712 INFO L350 Elim1Store]: Elim1 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-23 15:03:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2022-11-23 15:03:34,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:35,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-23 15:03:35,129 WARN L837 $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_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 15:03:36,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4898))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4897) .cse0 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4897) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 15:03:36,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:03:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996601936] [2022-11-23 15:03:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996601936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [480466206] [2022-11-23 15:03:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:03:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:03:36,448 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:03:36,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-23 15:03:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:41,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-23 15:03:41,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:41,307 INFO L350 Elim1Store]: Elim1 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-23 15:03:41,316 INFO L350 Elim1Store]: Elim1 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-23 15:03:41,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 15:03:41,999 INFO L350 Elim1Store]: Elim1 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-23 15:03:42,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:03:42,037 INFO L350 Elim1Store]: Elim1 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-23 15:03:42,131 INFO L350 Elim1Store]: Elim1 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-23 15:03:42,149 INFO L350 Elim1Store]: Elim1 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-23 15:03:42,284 INFO L350 Elim1Store]: Elim1 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-23 15:03:42,379 INFO L350 Elim1Store]: Elim1 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-23 15:03:43,241 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291))) (exists ((|v_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|) (_ bv40 32)))) is different from true [2022-11-23 15:03:44,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (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|) (_ bv40 32)))) is different from true [2022-11-23 15:03:45,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7|) (_ bv44 32))) (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|) (_ bv40 32)))) is different from true [2022-11-23 15:03:45,575 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (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|) (_ bv40 32)))) is different from true [2022-11-23 15:03:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:45,794 INFO L350 Elim1Store]: Elim1 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-23 15:03:46,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:46,089 INFO L350 Elim1Store]: Elim1 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-23 15:03:46,118 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-23 15:03:46,119 INFO L350 Elim1Store]: Elim1 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-23 15:03:46,301 INFO L350 Elim1Store]: Elim1 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-23 15:03:46,306 INFO L350 Elim1Store]: Elim1 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-23 15:03:46,414 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-23 15:03:46,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:46,891 INFO L350 Elim1Store]: Elim1 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-23 15:03:52,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5375))) (let ((.cse1 (select |c_#length| v_arrayElimCell_67)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse2 (bvadd (select (select (store .cse3 v_arrayElimCell_67 (store (select .cse3 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse0) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv8 32)))) (or (bvule .cse2 .cse1) (forall ((v_ArrVal_5329 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_5329)))))))))) (forall ((v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5375))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_5328 (_ BitVec 32))) (let ((.cse5 (select (select (store .cse6 v_arrayElimCell_67 (store (select .cse6 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse7) v_ArrVal_5328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse5) (bvadd (_ bv8 32) .cse5)))) (not (bvule (bvadd .cse7 (_ bv20 32)) (select |c_#length| v_arrayElimCell_67))))))))) is different from false [2022-11-23 15:03:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [480466206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692964767] [2022-11-23 15:03:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:52,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:03:52,547 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:03:52,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-23 15:03:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:53,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 15:03:53,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:53,723 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:03:53,723 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,733 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,753 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,770 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,858 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,865 INFO L350 Elim1Store]: Elim1 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-23 15:03:53,938 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5757))) (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,087 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5764))) (exists ((v_ArrVal_5765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5765))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5768))) (exists ((v_ArrVal_5769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5769) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5775))) (exists ((v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5774) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5777))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5776)))) is different from true [2022-11-23 15:03:54,307 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5779) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5778)))) is different from true [2022-11-23 15:03:54,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5780))) (exists ((v_ArrVal_5781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5781) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5783))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,365 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5784) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5787))) (exists ((v_ArrVal_5786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5786) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,404 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5788))) (exists ((v_ArrVal_5789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5789) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5790))) (exists ((v_ArrVal_5791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5791))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5793))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,463 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5794) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5795))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,482 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5797))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5796) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:03:54,503 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5799) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5798))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,523 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5801))) (exists ((v_ArrVal_5800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5800))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,542 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5803))) (exists ((v_ArrVal_5802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5802))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,562 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5805))) (exists ((v_ArrVal_5804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5804))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,581 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5807))) (exists ((v_ArrVal_5806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5806) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,601 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809))) (exists ((v_ArrVal_5808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5808))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,621 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,660 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5815) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,680 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5816)))) is different from true [2022-11-23 15:03:54,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5819))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:03:54,718 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,738 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,796 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,815 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,854 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834))) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,871 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,888 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,904 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,921 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842))) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:03:54,993 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:54,993 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,005 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,130 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:03:55,131 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,152 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,220 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,230 INFO L350 Elim1Store]: Elim1 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-23 15:03:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 969 not checked. [2022-11-23 15:03:55,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:55,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5844) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 15:03:55,379 WARN L837 $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_5844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5844) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-23 15:03:56,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5937))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5936) .cse0 v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5844) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5936) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-23 15:03:56,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692964767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:56,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:03:56,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 48] total 94 [2022-11-23 15:03:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697622334] [2022-11-23 15:03:56,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:03:56,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-11-23 15:03:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:03:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-11-23 15:03:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=579, Unknown=112, NotChecked=10206, Total=11130 [2022-11-23 15:03:56,629 INFO L87 Difference]: Start difference. First operand 1318 states and 1560 transitions. Second operand has 95 states, 92 states have (on average 2.9130434782608696) internal successors, (268), 95 states have internal predecessors, (268), 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-23 15:03:58,822 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5757))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_#t~mem38#1.base_BEFORE_CALL_7|) (_ bv44 32))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5756))) (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.base|)) (exists ((|v_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|) (_ bv40 32))) (exists ((v_arrayElimCell_49 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_49) (_ bv44 32)))) is different from true [2022-11-23 15:04:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:04:27,388 INFO L93 Difference]: Finished difference Result 1734 states and 2098 transitions. [2022-11-23 15:04:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 15:04:27,391 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 92 states have (on average 2.9130434782608696) internal successors, (268), 95 states have internal predecessors, (268), 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 120 [2022-11-23 15:04:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:04:27,393 INFO L225 Difference]: With dead ends: 1734 [2022-11-23 15:04:27,393 INFO L226 Difference]: Without dead ends: 1734 [2022-11-23 15:04:27,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 217 SyntacticMatches, 61 SemanticMatches, 115 ConstructedPredicates, 82 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=342, Invalid=1035, Unknown=141, NotChecked=12054, Total=13572 [2022-11-23 15:04:27,396 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 2311 mSDsluCounter, 4979 mSDsCounter, 0 mSdLazyCounter, 7581 mSolverCounterSat, 33 mSolverCounterUnsat, 990 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 120067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7581 IncrementalHoareTripleChecker+Invalid, 990 IncrementalHoareTripleChecker+Unknown, 111463 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:04:27,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5563 Invalid, 120067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 7581 Invalid, 990 Unknown, 111463 Unchecked, 28.6s Time] [2022-11-23 15:04:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-11-23 15:04:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1317. [2022-11-23 15:04:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 849 states have (on average 1.7832744405182568) internal successors, (1514), 1305 states have internal predecessors, (1514), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:04:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1559 transitions. [2022-11-23 15:04:27,424 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1559 transitions. Word has length 120 [2022-11-23 15:04:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:04:27,424 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1559 transitions. [2022-11-23 15:04:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 92 states have (on average 2.9130434782608696) internal successors, (268), 95 states have internal predecessors, (268), 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-23 15:04:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1559 transitions. [2022-11-23 15:04:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-23 15:04:27,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:04:27,426 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] [2022-11-23 15:04:27,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-23 15:04:27,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-23 15:04:27,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-23 15:04:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:04:28,048 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:04:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:04:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash -711351981, now seen corresponding path program 1 times [2022-11-23 15:04:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:04:28,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144022358] [2022-11-23 15:04:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:04:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:04:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:04:28,050 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:04:28,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-23 15:04:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:04:29,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 15:04:29,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:04:29,347 INFO L350 Elim1Store]: Elim1 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-23 15:04:29,626 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 15:04:29,626 INFO L350 Elim1Store]: Elim1 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-23 15:04:29,662 INFO L350 Elim1Store]: Elim1 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-23 15:04:29,815 INFO L350 Elim1Store]: Elim1 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-23 15:04:32,093 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:04:32,093 INFO L350 Elim1Store]: Elim1 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-23 15:04:32,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:04:32,242 INFO L350 Elim1Store]: Elim1 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-23 15:04:32,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:04:32,385 INFO L350 Elim1Store]: Elim1 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-23 15:04:32,419 INFO L350 Elim1Store]: Elim1 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-23 15:04:32,478 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-23 15:04:32,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:04:32,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6377) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-23 15:04:32,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6377 (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_6377) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 15:04:32,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (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~mem40#1.base| v_ArrVal_6376))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6377)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:04:32,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6376))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6377)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:04:33,048 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6423))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6376)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6377)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 15:04:33,052 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:04:33,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144022358] [2022-11-23 15:04:33,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144022358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:04:33,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1806992639] [2022-11-23 15:04:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:04:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:04:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:04:33,054 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:04:33,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-23 15:05:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:05:03,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-23 15:05:03,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:05:03,360 INFO L350 Elim1Store]: Elim1 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-23 15:05:03,574 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 15:05:03,574 INFO L350 Elim1Store]: Elim1 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-23 15:05:03,597 INFO L350 Elim1Store]: Elim1 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-23 15:05:03,683 INFO L350 Elim1Store]: Elim1 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-23 15:05:04,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841)))) is different from true [2022-11-23 15:05:05,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:05,899 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:05,899 INFO L350 Elim1Store]: Elim1 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-23 15:05:05,998 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:05,998 INFO L350 Elim1Store]: Elim1 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-23 15:05:06,078 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:06,078 INFO L350 Elim1Store]: Elim1 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-23 15:05:06,110 INFO L350 Elim1Store]: Elim1 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-23 15:05:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-23 15:05:06,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:05:08,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6863 (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_6863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 15:05:08,257 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6863 (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~mem40#1.base| v_ArrVal_6862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:05:08,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 15:05:08,681 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6909 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6909))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6862)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 15:05:08,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1806992639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:05:08,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930509087] [2022-11-23 15:05:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:05:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:05:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:05:08,688 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:05:08,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-23 15:05:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:05:09,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-23 15:05:09,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:05:09,924 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:05:09,925 INFO L350 Elim1Store]: Elim1 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-23 15:05:09,975 INFO L350 Elim1Store]: Elim1 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-23 15:05:10,192 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302))) is different from true [2022-11-23 15:05:10,199 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,206 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,214 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,221 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,229 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307))) is different from true [2022-11-23 15:05:10,237 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,252 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) is different from true [2022-11-23 15:05:10,259 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311))) is different from true [2022-11-23 15:05:10,267 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312))) is different from true [2022-11-23 15:05:10,274 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,282 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) is different from true [2022-11-23 15:05:10,297 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7315) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,305 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7316))) is different from true [2022-11-23 15:05:10,312 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7317) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,320 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7318))) is different from true [2022-11-23 15:05:10,328 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7319))) is different from true [2022-11-23 15:05:10,335 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7320) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,343 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7321))) is different from true [2022-11-23 15:05:10,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7322))) is different from true [2022-11-23 15:05:10,359 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7323) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,366 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7324) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,374 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7325))) is different from true [2022-11-23 15:05:10,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7326))) is different from true [2022-11-23 15:05:10,389 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) is different from true [2022-11-23 15:05:10,396 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328))) is different from true [2022-11-23 15:05:10,404 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) is different from true [2022-11-23 15:05:10,411 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330))) is different from true [2022-11-23 15:05:10,423 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7331) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,430 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7332) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,438 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7333))) is different from true [2022-11-23 15:05:10,445 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7334))) is different from true [2022-11-23 15:05:10,453 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) is different from true [2022-11-23 15:05:10,461 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) is different from true [2022-11-23 15:05:10,468 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,479 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338))) is different from true [2022-11-23 15:05:10,488 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) is different from true [2022-11-23 15:05:10,495 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340))) is different from true [2022-11-23 15:05:10,503 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) is different from true [2022-11-23 15:05:10,510 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,518 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) is different from true [2022-11-23 15:05:10,525 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) is different from true [2022-11-23 15:05:10,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345))) is different from true [2022-11-23 15:05:10,568 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:10,568 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 26 [2022-11-23 15:05:10,686 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:10,686 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 26 [2022-11-23 15:05:10,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:10,803 INFO L350 Elim1Store]: Elim1 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-23 15:05:10,896 INFO L350 Elim1Store]: Elim1 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-23 15:05:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-23 15:05:10,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:05:10,933 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-23 15:05:10,933 INFO L350 Elim1Store]: Elim1 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-23 15:05:11,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7347) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-23 15:05:11,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7346)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7347) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-23 15:05:11,115 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7346))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7347) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-23 15:05:11,550 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7393))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7346)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7347) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-23 15:05:11,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930509087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:05:11,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:05:11,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 55] total 65 [2022-11-23 15:05:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114791262] [2022-11-23 15:05:11,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:05:11,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-23 15:05:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:05:11,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-23 15:05:11,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=459, Unknown=88, NotChecked=5900, Total=6642 [2022-11-23 15:05:11,557 INFO L87 Difference]: Start difference. First operand 1317 states and 1559 transitions. Second operand has 66 states, 63 states have (on average 2.7936507936507935) internal successors, (176), 66 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:05:13,678 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332)))) is different from true [2022-11-23 15:05:13,683 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,688 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,715 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,720 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311)))) is different from true [2022-11-23 15:05:13,731 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,737 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,748 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7316))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,764 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7318))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,769 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7319))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7320) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,779 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7321))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7322))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7323) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,796 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7324) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7325)))) is different from true [2022-11-23 15:05:13,806 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7326))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,817 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,822 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7329))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,828 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7330))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7331) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7332) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,844 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7333))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7334)))) is different from true [2022-11-23 15:05:13,854 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,866 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7337) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_7338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7338))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,895 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340)))) is different from true [2022-11-23 15:05:13,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,906 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,911 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,917 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,922 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,927 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841))) (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:13,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (= (bvadd (select |c_#valid| v_arrayElimCell_80) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_80 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)))) (exists ((v_ArrVal_6332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6332)))) is different from true [2022-11-23 15:05:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:05:49,677 INFO L93 Difference]: Finished difference Result 2200 states and 2650 transitions. [2022-11-23 15:05:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-11-23 15:05:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.7936507936507935) internal successors, (176), 66 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2022-11-23 15:05:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:05:49,685 INFO L225 Difference]: With dead ends: 2200 [2022-11-23 15:05:49,685 INFO L226 Difference]: Without dead ends: 2200 [2022-11-23 15:05:49,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 229 SyntacticMatches, 88 SemanticMatches, 137 ConstructedPredicates, 105 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=396, Invalid=1000, Unknown=146, NotChecked=17640, Total=19182 [2022-11-23 15:05:49,689 INFO L413 NwaCegarLoop]: 1095 mSDtfsCounter, 1612 mSDsluCounter, 9200 mSDsCounter, 0 mSdLazyCounter, 9780 mSolverCounterSat, 31 mSolverCounterUnsat, 1534 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 10295 SdHoareTripleChecker+Invalid, 100703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 9780 IncrementalHoareTripleChecker+Invalid, 1534 IncrementalHoareTripleChecker+Unknown, 89358 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:05:49,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 10295 Invalid, 100703 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [31 Valid, 9780 Invalid, 1534 Unknown, 89358 Unchecked, 36.5s Time] [2022-11-23 15:05:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2022-11-23 15:05:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1316. [2022-11-23 15:05:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 849 states have (on average 1.7820965842167256) internal successors, (1513), 1304 states have internal predecessors, (1513), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-23 15:05:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1558 transitions. [2022-11-23 15:05:49,714 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1558 transitions. Word has length 123 [2022-11-23 15:05:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:05:49,714 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1558 transitions. [2022-11-23 15:05:49,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.7936507936507935) internal successors, (176), 66 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:05:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1558 transitions. [2022-11-23 15:05:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-23 15:05:49,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:05:49,717 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] [2022-11-23 15:05:49,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-23 15:05:49,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-23 15:05:50,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-23 15:05:50,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:05:50,338 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:05:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:05:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash -711351980, now seen corresponding path program 1 times [2022-11-23 15:05:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:05:50,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914689907] [2022-11-23 15:05:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:05:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:05:50,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:05:50,341 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:05:50,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-23 15:05:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:05:51,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 15:05:51,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:05:51,819 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,011 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:05:52,012 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,023 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,058 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,070 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,232 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,240 INFO L350 Elim1Store]: Elim1 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-23 15:05:52,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793)))) is different from true [2022-11-23 15:05:52,406 WARN L859 $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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:05:52,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (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|))) is different from true [2022-11-23 15:05:52,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:05:52,456 WARN L859 $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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:05:52,472 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:52,489 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804)))) is different from true [2022-11-23 15:05:52,505 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806)))) is different from true [2022-11-23 15:05:52,562 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-11-23 15:05:52,583 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:52,597 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815)))) is different from true [2022-11-23 15:05:52,612 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:52,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818)))) is different from true [2022-11-23 15:05:52,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821)))) is different from true [2022-11-23 15:05:52,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822)))) is different from true [2022-11-23 15:05:52,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:52,700 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:52,717 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828)))) is different from true [2022-11-23 15:05:52,734 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:52,751 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833)))) is different from true [2022-11-23 15:05:52,767 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834)))) is different from true [2022-11-23 15:05:52,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837)))) is different from true [2022-11-23 15:05:52,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-11-23 15:05:52,831 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840)))) is different from true [2022-11-23 15:05:52,850 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842))) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:52,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845)))) is different from true [2022-11-23 15:05:52,893 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846)))) is different from true [2022-11-23 15:05:52,911 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:52,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851)))) is different from true [2022-11-23 15:05:52,949 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:52,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855)))) is different from true [2022-11-23 15:05:52,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857))) (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856)))) is different from true [2022-11-23 15:05:53,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:53,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7861))) (exists ((v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7860)))) is different from true [2022-11-23 15:05:53,051 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7863))) (exists ((v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7862) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:05:53,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864)))) is different from true [2022-11-23 15:05:53,090 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7867 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7867))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7866) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:53,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869))) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868)))) is different from true [2022-11-23 15:05:53,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7871))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7870) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:53,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7872)))) is different from true [2022-11-23 15:05:53,167 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874)))) is different from true [2022-11-23 15:05:53,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7877))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7876) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:05:53,247 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:53,247 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,259 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:53,448 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,468 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,633 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:05:53,634 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,660 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,703 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,718 INFO L350 Elim1Store]: Elim1 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-23 15:05:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-11-23 15:05:53,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:05:54,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 15:05:54,096 WARN L837 $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_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-23 15:06:00,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7973))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7879))) (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~mem38#1.base| v_ArrVal_7972) .cse0 v_ArrVal_7878) .cse1 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7973))) (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~mem38#1.base| v_ArrVal_7972) .cse6 v_ArrVal_7878) (select (select (store .cse7 .cse6 v_ArrVal_7879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-23 15:06:00,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:06:00,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914689907] [2022-11-23 15:06:00,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914689907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:06:00,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [219148532] [2022-11-23 15:06:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:06:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:06:00,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:06:00,235 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:06:00,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-23 15:10:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:10:40,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-23 15:10:40,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:10:40,790 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,126 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,167 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:10:41,167 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,184 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,201 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,338 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,348 INFO L350 Elim1Store]: Elim1 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-23 15:10:41,543 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372)))) is different from true [2022-11-23 15:10:41,571 WARN L859 $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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:41,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377)))) is different from true [2022-11-23 15:10:41,769 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383)))) is different from true [2022-11-23 15:10:41,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (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_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-23 15:10:42,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:42,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:42,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:42,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:10:42,426 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409)))) is different from true [2022-11-23 15:10:42,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411)))) is different from true [2022-11-23 15:10:42,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:42,506 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-11-23 15:10:42,534 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416)))) is different from true [2022-11-23 15:10:42,562 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8419))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8418)))) is different from true [2022-11-23 15:10:42,589 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8420)))) is different from true [2022-11-23 15:10:42,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8423))) (exists ((v_ArrVal_8422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8422)))) is different from true [2022-11-23 15:10:42,646 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8425) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8424)))) is different from true [2022-11-23 15:10:42,675 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8426))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8427)))) is different from true [2022-11-23 15:10:42,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8428))) (exists ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8429)))) is different from true [2022-11-23 15:10:42,732 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8430))) (exists ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8431))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:42,763 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8433) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8432)))) is different from true [2022-11-23 15:10:42,794 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8434) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8435) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:42,823 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8436) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8437)))) is different from true [2022-11-23 15:10:42,852 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8438))) (exists ((v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8439) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:42,881 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8441) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8440) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:42,910 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8442))) (exists ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8443)))) is different from true [2022-11-23 15:10:42,938 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8444) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8445)))) is different from true [2022-11-23 15:10:42,964 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8446))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8447)))) is different from true [2022-11-23 15:10:42,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8449))) (exists ((v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8448) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:43,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8450))) (exists ((v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8451)))) is different from true [2022-11-23 15:10:43,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8452))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8453) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:43,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8454))) (exists ((v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8455)))) is different from true [2022-11-23 15:10:43,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8456))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8457)))) is different from true [2022-11-23 15:10:43,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:43,198 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,223 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,394 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:43,395 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,422 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:43,544 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,564 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,618 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,634 INFO L350 Elim1Store]: Elim1 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-23 15:10:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2022-11-23 15:10:43,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:10:43,760 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 15:10:43,816 WARN L837 $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_8461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 15:10:43,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8458) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8459))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8458) .cse2 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 15:10:43,975 WARN L837 $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_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8458) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8459))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8458) .cse3 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-23 15:10:45,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8553))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8459))) (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~mem38#1.base| v_ArrVal_8552) .cse0 v_ArrVal_8458) .cse1 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8553))) (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~mem38#1.base| v_ArrVal_8552) .cse6 v_ArrVal_8458) (select (select (store .cse7 .cse6 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8461))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-23 15:10:45,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [219148532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:10:45,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699099187] [2022-11-23 15:10:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:10:45,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:10:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:10:45,620 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:10:45,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-23 15:10:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:10:46,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 15:10:46,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:10:47,006 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 15:10:47,006 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,022 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,049 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,074 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,206 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,216 INFO L350 Elim1Store]: Elim1 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-23 15:10:47,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8949)))) is different from true [2022-11-23 15:10:47,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:47,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,488 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958)))) is different from true [2022-11-23 15:10:47,517 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:47,548 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962))) (exists ((v_ArrVal_8961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8961)))) is different from true [2022-11-23 15:10:47,580 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,611 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8967))) (exists ((v_ArrVal_8968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8968) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8970))) (exists ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8969))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:47,701 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8971))) (exists ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8972)))) is different from true [2022-11-23 15:10:47,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8974)))) is different from true [2022-11-23 15:10:47,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8975) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8976) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,815 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8977 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8977) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8978) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8980) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8979) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:47,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8982))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8981)))) is different from true [2022-11-23 15:10:47,910 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8983))) (exists ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8984) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:47,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8985))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:47,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8988) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8987)))) is different from true [2022-11-23 15:10:48,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8990 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8990) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8989)))) is different from true [2022-11-23 15:10:48,039 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8992))) (exists ((v_ArrVal_8991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8991)))) is different from true [2022-11-23 15:10:48,071 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8994))) (exists ((v_ArrVal_8993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8993)))) is different from true [2022-11-23 15:10:48,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8996))) (exists ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8995)))) is different from true [2022-11-23 15:10:48,133 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_8997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8997))) (exists ((v_ArrVal_8998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8998)))) is different from true [2022-11-23 15:10:48,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9000))) (exists ((v_ArrVal_8999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8999)))) is different from true [2022-11-23 15:10:48,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9002) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9001) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:48,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9003))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9004) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:48,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9006)))) is different from true [2022-11-23 15:10:48,285 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9007))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9008)))) is different from true [2022-11-23 15:10:48,315 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9009) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9010))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32)))) is different from true [2022-11-23 15:10:48,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9011) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 15:10:48,376 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9013))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9014)))) is different from true [2022-11-23 15:10:48,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9015) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9016)))) is different from true [2022-11-23 15:10:48,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9017))) (exists ((v_ArrVal_9018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9018)))) is different from true [2022-11-23 15:10:48,467 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9020)))) is different from true [2022-11-23 15:10:48,497 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9021)))) is different from true [2022-11-23 15:10:48,527 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9024))) (exists ((v_ArrVal_9023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9023)))) is different from true [2022-11-23 15:10:48,557 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9026) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9025)))) is different from true [2022-11-23 15:10:48,587 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9027) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9028)))) is different from true [2022-11-23 15:10:48,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9030) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9029)))) is different from true [2022-11-23 15:10:48,647 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9031) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9032)))) is different from true [2022-11-23 15:10:48,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9034))) (exists ((v_ArrVal_9033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9033) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 15:10:48,708 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_9036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9036) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9035)))) is different from true [2022-11-23 15:10:48,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:48,816 INFO L350 Elim1Store]: Elim1 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-23 15:10:48,828 INFO L350 Elim1Store]: Elim1 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-23 15:10:48,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:48,997 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,025 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:10:49,165 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,193 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,241 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,258 INFO L350 Elim1Store]: Elim1 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-23 15:10:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-23 15:10:49,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:10:49,387 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 15:10:49,440 WARN L837 $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_9040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 15:10:49,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9038))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9037) .cse0 v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9037) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2022-11-23 15:10:49,610 WARN L837 $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_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9038))) (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_9037) .cse1 v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9037) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-23 15:10:52,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9131))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9132) .cse1 v_ArrVal_9037) (select (select (store .cse2 .cse1 v_ArrVal_9038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9040))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9131))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9038))) (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~mem38#1.base| v_ArrVal_9132) .cse4 v_ArrVal_9037) .cse5 v_ArrVal_9040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-23 15:10:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699099187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:10:52,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:10:52,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 44, 54] total 131 [2022-11-23 15:10:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140852042] [2022-11-23 15:10:52,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:10:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-23 15:10:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:10:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-23 15:10:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=307, Unknown=157, NotChecked=21280, Total=22052 [2022-11-23 15:10:52,605 INFO L87 Difference]: Start difference. First operand 1316 states and 1558 transitions. Second operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 132 states have internal predecessors, (239), 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-23 15:10:54,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8950))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8949))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790)))) is different from true [2022-11-23 15:10:54,701 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_arrayElimCell_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (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_ArrVal_8952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8952))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (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|)) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:10:54,714 WARN L859 $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_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_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (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_ArrVal_8953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8953))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409))) (exists ((v_ArrVal_8954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8954) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812) |c_#memory_$Pointer$.base|)) (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|)) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:10:54,748 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (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_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_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (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_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (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_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (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_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812) |c_#memory_$Pointer$.base|)) (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|)) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:10:54,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (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_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_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (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_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412))) (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (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_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (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_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (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_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (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_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (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|)) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414))) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:10:54,923 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (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_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_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (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_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412))) (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (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_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (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_102 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_102) (_ bv44 32))) (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813) |c_#memory_$Pointer$.offset|)) (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_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (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_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (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_ArrVal_8962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8962))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8961))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (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|)) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414))) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818))) (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406)))) is different from true [2022-11-23 15:11:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:11:19,303 INFO L93 Difference]: Finished difference Result 1337 states and 1581 transitions. [2022-11-23 15:11:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 15:11:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 132 states have internal predecessors, (239), 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 123 [2022-11-23 15:11:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:11:19,307 INFO L225 Difference]: With dead ends: 1337 [2022-11-23 15:11:19,308 INFO L226 Difference]: Without dead ends: 1337 [2022-11-23 15:11:19,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 162 ConstructedPredicates, 139 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=399, Invalid=586, Unknown=171, NotChecked=25576, Total=26732 [2022-11-23 15:11:19,311 INFO L413 NwaCegarLoop]: 730 mSDtfsCounter, 1575 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 4373 mSolverCounterSat, 23 mSolverCounterUnsat, 414 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 141006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4373 IncrementalHoareTripleChecker+Invalid, 414 IncrementalHoareTripleChecker+Unknown, 136196 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:11:19,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 3786 Invalid, 141006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 4373 Invalid, 414 Unknown, 136196 Unchecked, 25.0s Time] [2022-11-23 15:11:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-11-23 15:11:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1329. [2022-11-23 15:11:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 861 states have (on average 1.7735191637630663) internal successors, (1527), 1316 states have internal predecessors, (1527), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (24), 9 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-23 15:11:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1573 transitions. [2022-11-23 15:11:19,333 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1573 transitions. Word has length 123 [2022-11-23 15:11:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:11:19,334 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1573 transitions. [2022-11-23 15:11:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 132 states have internal predecessors, (239), 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-23 15:11:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1573 transitions. [2022-11-23 15:11:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 15:11:19,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:11:19,337 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 15:11:19,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-23 15:11:19,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-23 15:11:19,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-23 15:11:19,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 15:11:19,952 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-11-23 15:11:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:11:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1005999679, now seen corresponding path program 2 times [2022-11-23 15:11:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:11:19,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093265886] [2022-11-23 15:11:19,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:11:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:11:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:11:19,954 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 15:11:19,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-23 15:11:21,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:11:21,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:11:21,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 15:11:21,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:11:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:11:28,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:11:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:11:52,016 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:11:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093265886] [2022-11-23 15:11:52,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093265886] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:11:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955081235] [2022-11-23 15:11:52,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:11:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 15:11:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 15:11:52,018 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 15:11:52,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-23 15:11:59,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 15:11:59,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:11:59,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 15:11:59,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:11:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:11:59,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:01,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [955081235] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:12:01,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279048690] [2022-11-23 15:12:01,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:12:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:01,886 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:01,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fd362c5-d10c-4a1b-b148-127cb14a0582/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process