./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:31,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:31,441 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:21:31,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:31,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:31,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:31,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:31,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:31,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:31,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:31,472 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:31,473 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:31,473 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:31,473 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:21:31,474 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:31,474 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:31,475 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:21:31,475 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:21:31,476 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:31,476 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:21:31,477 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:21:31,477 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:21:31,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:21:31,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:21:31,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:31,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:31,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:21:31,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:31,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:31,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:21:31,481 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:21:31,482 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:21:31,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:31,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:21:31,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:21:31,483 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:31,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:31,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:31,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:31,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:31,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:31,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:31,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:31,484 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:21:31,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:21:31,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:31,485 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:31,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:31,485 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-12-02 15:21:31,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:31,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:31,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:31,736 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:31,737 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:31,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-12-02 15:21:34,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:34,821 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:34,822 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-12-02 15:21:34,841 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/24ca05d3f/c4e2e7d17e6d4b6691336a4beab316b4/FLAG95cb2e1cd [2023-12-02 15:21:34,854 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/24ca05d3f/c4e2e7d17e6d4b6691336a4beab316b4 [2023-12-02 15:21:34,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:34,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:34,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:34,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:34,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:34,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:34" (1/1) ... [2023-12-02 15:21:34,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa7fc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:34, skipping insertion in model container [2023-12-02 15:21:34,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:34" (1/1) ... [2023-12-02 15:21:34,936 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:35,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:35,387 ERROR L324 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) [2023-12-02 15:21:35,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51d04281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:35, skipping insertion in model container [2023-12-02 15:21:35,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:35,388 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 15:21:35,390 INFO L158 Benchmark]: Toolchain (without parser) took 531.07ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 103.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:21:35,390 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:21:35,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.89ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 103.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:21:35,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.89ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 103.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:37,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:37,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 15:21:37,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:37,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:37,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:37,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:37,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:37,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:37,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:37,431 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:37,431 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:37,432 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:37,433 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:37,433 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:37,434 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:37,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:21:37,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:21:37,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:37,437 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:37,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:21:37,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:37,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:37,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:21:37,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:21:37,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:21:37,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:37,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:21:37,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:21:37,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:21:37,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:21:37,442 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:37,443 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:37,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:37,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:21:37,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:37,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:37,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:37,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:37,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:37,445 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:21:37,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:37,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:37,446 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:37,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:37,446 INFO L153 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_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-12-02 15:21:37,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:37,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:37,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:37,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:37,774 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:37,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-12-02 15:21:40,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:40,935 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:40,936 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-12-02 15:21:40,959 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/ea6bafea3/c1fd7f6672d84e28a84b61ea9c4d1d45/FLAG2b97a5330 [2023-12-02 15:21:40,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/data/ea6bafea3/c1fd7f6672d84e28a84b61ea9c4d1d45 [2023-12-02 15:21:40,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:40,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:40,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:40,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:40,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:40,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:40" (1/1) ... [2023-12-02 15:21:40,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516463d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:40, skipping insertion in model container [2023-12-02 15:21:40,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:40" (1/1) ... [2023-12-02 15:21:41,065 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:41,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:41,604 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 15:21:41,623 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:41,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:41,704 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:21:41,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:41,826 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:21:41,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41 WrapperNode [2023-12-02 15:21:41,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:41,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:41,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:21:41,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:21:41,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,910 INFO L138 Inliner]: procedures = 180, calls = 228, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 758 [2023-12-02 15:21:41,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:41,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:21:41,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:21:41,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:21:41,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:41,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:42,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:21:42,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:21:42,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:21:42,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:21:42,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (1/1) ... [2023-12-02 15:21:42,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:42,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:21:42,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:21:42,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 15:21:42,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:21:42,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 15:21:42,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 15:21:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:21:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:21:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:21:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:21:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:21:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:21:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:21:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:21:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:21:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:21:42,303 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:21:42,305 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:21:42,309 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 15:21:45,907 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:21:46,089 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:21:46,089 INFO L309 CfgBuilder]: Removed 40 assume(true) statements. [2023-12-02 15:21:46,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:46 BoogieIcfgContainer [2023-12-02 15:21:46,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:21:46,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:21:46,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:21:46,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:21:46,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:21:40" (1/3) ... [2023-12-02 15:21:46,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffed698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:46, skipping insertion in model container [2023-12-02 15:21:46,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:41" (2/3) ... [2023-12-02 15:21:46,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffed698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:46, skipping insertion in model container [2023-12-02 15:21:46,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:46" (3/3) ... [2023-12-02 15:21:46,100 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-2.i [2023-12-02 15:21:46,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:21:46,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2023-12-02 15:21:46,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:21:46,192 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;@14db3215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:21:46,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2023-12-02 15:21:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:21:46,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:46,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:21:46,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:46,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 38687686, now seen corresponding path program 1 times [2023-12-02 15:21:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333449768] [2023-12-02 15:21:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:46,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 [2023-12-02 15:21:46,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:46,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:46,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:46,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 15:21:46,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:46,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:46,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333449768] [2023-12-02 15:21:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333449768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530981725] [2023-12-02 15:21:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:46,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:21:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:21:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:21:46,411 INFO L87 Difference]: Start difference. First operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-12-02 15:21:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:46,996 INFO L93 Difference]: Finished difference Result 757 states and 795 transitions. [2023-12-02 15:21:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:21:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-02 15:21:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:47,019 INFO L225 Difference]: With dead ends: 757 [2023-12-02 15:21:47,019 INFO L226 Difference]: Without dead ends: 756 [2023-12-02 15:21:47,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:21:47,024 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:47,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:21:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2023-12-02 15:21:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2023-12-02 15:21:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 325 states have (on average 2.4246153846153846) internal successors, (788), 751 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 794 transitions. [2023-12-02 15:21:47,107 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 794 transitions. Word has length 4 [2023-12-02 15:21:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:47,108 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 794 transitions. [2023-12-02 15:21:47,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-12-02 15:21:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 794 transitions. [2023-12-02 15:21:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:21:47,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:47,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:21:47,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:21:47,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:47,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:47,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 38687748, now seen corresponding path program 1 times [2023-12-02 15:21:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141989493] [2023-12-02 15:21:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:47,312 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 [2023-12-02 15:21:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:47,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:47,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:47,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:21:47,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:47,487 INFO L378 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 [2023-12-02 15:21:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:47,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:47,506 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141989493] [2023-12-02 15:21:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141989493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728298797] [2023-12-02 15:21:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:47,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:47,510 INFO L87 Difference]: Start difference. First operand 756 states and 794 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-12-02 15:21:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:49,103 INFO L93 Difference]: Finished difference Result 717 states and 756 transitions. [2023-12-02 15:21:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-12-02 15:21:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:49,108 INFO L225 Difference]: With dead ends: 717 [2023-12-02 15:21:49,109 INFO L226 Difference]: Without dead ends: 717 [2023-12-02 15:21:49,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:49,110 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 515 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:49,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 507 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 15:21:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-12-02 15:21:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2023-12-02 15:21:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 325 states have (on average 2.273846153846154) internal successors, (739), 702 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 745 transitions. [2023-12-02 15:21:49,134 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 745 transitions. Word has length 4 [2023-12-02 15:21:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:49,135 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 745 transitions. [2023-12-02 15:21:49,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-12-02 15:21:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 745 transitions. [2023-12-02 15:21:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:21:49,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:49,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:21:49,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:21:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:49,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:49,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 38687749, now seen corresponding path program 1 times [2023-12-02 15:21:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:49,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512149025] [2023-12-02 15:21:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:49,351 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 [2023-12-02 15:21:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:49,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:49,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:49,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:21:49,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:49,433 INFO L378 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 [2023-12-02 15:21:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:49,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:49,455 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512149025] [2023-12-02 15:21:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512149025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856494141] [2023-12-02 15:21:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:49,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:49,457 INFO L87 Difference]: Start difference. First operand 707 states and 745 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-12-02 15:21:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:51,624 INFO L93 Difference]: Finished difference Result 766 states and 808 transitions. [2023-12-02 15:21:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-12-02 15:21:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:51,629 INFO L225 Difference]: With dead ends: 766 [2023-12-02 15:21:51,629 INFO L226 Difference]: Without dead ends: 766 [2023-12-02 15:21:51,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:51,631 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 231 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:51,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 790 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 15:21:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-12-02 15:21:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 719. [2023-12-02 15:21:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 348 states have (on average 2.2557471264367814) internal successors, (785), 714 states have internal predecessors, (785), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 791 transitions. [2023-12-02 15:21:51,660 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 791 transitions. Word has length 4 [2023-12-02 15:21:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:51,660 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 791 transitions. [2023-12-02 15:21:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-12-02 15:21:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 791 transitions. [2023-12-02 15:21:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:21:51,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:51,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:21:51,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:21:51,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:51,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:51,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1200148537, now seen corresponding path program 1 times [2023-12-02 15:21:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141673395] [2023-12-02 15:21:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:51,863 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 [2023-12-02 15:21:51,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:51,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:51,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:51,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:21:51,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:51,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:51,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:51,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141673395] [2023-12-02 15:21:51,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141673395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:51,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:51,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836879486] [2023-12-02 15:21:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:51,937 INFO L87 Difference]: Start difference. First operand 719 states and 791 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:52,965 INFO L93 Difference]: Finished difference Result 1236 states and 1368 transitions. [2023-12-02 15:21:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 15:21:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:52,972 INFO L225 Difference]: With dead ends: 1236 [2023-12-02 15:21:52,972 INFO L226 Difference]: Without dead ends: 1236 [2023-12-02 15:21:52,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:52,974 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 513 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:52,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1293 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:21:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-12-02 15:21:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 720. [2023-12-02 15:21:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 349 states have (on average 2.2521489971346704) internal successors, (786), 715 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 792 transitions. [2023-12-02 15:21:52,995 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 792 transitions. Word has length 5 [2023-12-02 15:21:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:52,995 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 792 transitions. [2023-12-02 15:21:52,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 792 transitions. [2023-12-02 15:21:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:21:52,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:52,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:52,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:53,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:53,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 830977584, now seen corresponding path program 1 times [2023-12-02 15:21:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811698190] [2023-12-02 15:21:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:53,200 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 [2023-12-02 15:21:53,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:53,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:53,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:53,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:21:53,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:53,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:53,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811698190] [2023-12-02 15:21:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811698190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518550573] [2023-12-02 15:21:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:53,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:53,357 INFO L87 Difference]: Start difference. First operand 720 states and 792 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) [2023-12-02 15:21:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:54,188 INFO L93 Difference]: Finished difference Result 681 states and 752 transitions. [2023-12-02 15:21:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:54,190 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 [2023-12-02 15:21:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:54,193 INFO L225 Difference]: With dead ends: 681 [2023-12-02 15:21:54,193 INFO L226 Difference]: Without dead ends: 681 [2023-12-02 15:21:54,194 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 [2023-12-02 15:21:54,194 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 70 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:54,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1151 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 15:21:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-12-02 15:21:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2023-12-02 15:21:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 334 states have (on average 2.2335329341317367) internal successors, (746), 676 states have internal predecessors, (746), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 752 transitions. [2023-12-02 15:21:54,210 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 752 transitions. Word has length 11 [2023-12-02 15:21:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:54,210 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 752 transitions. [2023-12-02 15:21:54,210 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) [2023-12-02 15:21:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 752 transitions. [2023-12-02 15:21:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:21:54,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:54,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:54,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:54,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:54,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:54,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -294462806, now seen corresponding path program 1 times [2023-12-02 15:21:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680874325] [2023-12-02 15:21:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:54,413 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 [2023-12-02 15:21:54,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:54,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:54,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:54,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:21:54,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:54,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:54,541 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680874325] [2023-12-02 15:21:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680874325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550779026] [2023-12-02 15:21:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:54,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:54,543 INFO L87 Difference]: Start difference. First operand 681 states and 752 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:55,437 INFO L93 Difference]: Finished difference Result 667 states and 731 transitions. [2023-12-02 15:21:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:21:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 15:21:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:55,443 INFO L225 Difference]: With dead ends: 667 [2023-12-02 15:21:55,444 INFO L226 Difference]: Without dead ends: 667 [2023-12-02 15:21:55,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:55,445 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 58 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:55,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1683 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:21:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-12-02 15:21:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 666. [2023-12-02 15:21:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 333 states have (on average 2.174174174174174) internal successors, (724), 661 states have internal predecessors, (724), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 730 transitions. [2023-12-02 15:21:55,465 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 730 transitions. Word has length 13 [2023-12-02 15:21:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:55,465 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 730 transitions. [2023-12-02 15:21:55,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 730 transitions. [2023-12-02 15:21:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:21:55,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:55,467 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] [2023-12-02 15:21:55,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:21:55,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:55,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:55,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash 656726008, now seen corresponding path program 1 times [2023-12-02 15:21:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887745613] [2023-12-02 15:21:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:55,671 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 [2023-12-02 15:21:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:55,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:55,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:55,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:21:55,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:55,789 INFO L378 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 [2023-12-02 15:21:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:55,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:55,879 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:55,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887745613] [2023-12-02 15:21:55,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887745613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:55,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564046956] [2023-12-02 15:21:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:55,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:55,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:55,882 INFO L87 Difference]: Start difference. First operand 666 states and 730 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:57,669 INFO L93 Difference]: Finished difference Result 672 states and 737 transitions. [2023-12-02 15:21:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:21:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:21:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:57,674 INFO L225 Difference]: With dead ends: 672 [2023-12-02 15:21:57,675 INFO L226 Difference]: Without dead ends: 672 [2023-12-02 15:21:57,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:57,676 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 448 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:57,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 713 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 15:21:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-12-02 15:21:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 662. [2023-12-02 15:21:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 333 states have (on average 2.1621621621621623) internal successors, (720), 657 states have internal predecessors, (720), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:21:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 726 transitions. [2023-12-02 15:21:57,693 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 726 transitions. Word has length 27 [2023-12-02 15:21:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:57,694 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 726 transitions. [2023-12-02 15:21:57,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 726 transitions. [2023-12-02 15:21:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:21:57,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:57,695 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] [2023-12-02 15:21:57,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:57,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:57,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:21:57,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 656726009, now seen corresponding path program 1 times [2023-12-02 15:21:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:57,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003763360] [2023-12-02 15:21:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:57,897 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 [2023-12-02 15:21:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:57,898 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:21:57,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:21:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:58,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:21:58,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:58,011 INFO L378 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 [2023-12-02 15:21:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:58,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:58,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003763360] [2023-12-02 15:21:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003763360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833484888] [2023-12-02 15:21:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:58,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:58,220 INFO L87 Difference]: Start difference. First operand 662 states and 726 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:00,866 INFO L93 Difference]: Finished difference Result 705 states and 739 transitions. [2023-12-02 15:22:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:22:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:22:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:00,870 INFO L225 Difference]: With dead ends: 705 [2023-12-02 15:22:00,870 INFO L226 Difference]: Without dead ends: 705 [2023-12-02 15:22:00,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:22:00,871 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 167 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:00,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1012 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 15:22:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-12-02 15:22:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2023-12-02 15:22:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 333 states have (on average 2.15015015015015) internal successors, (716), 653 states have internal predecessors, (716), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 722 transitions. [2023-12-02 15:22:00,883 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 722 transitions. Word has length 27 [2023-12-02 15:22:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:00,883 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 722 transitions. [2023-12-02 15:22:00,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 722 transitions. [2023-12-02 15:22:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 15:22:00,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:00,885 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] [2023-12-02 15:22:00,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:01,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:01,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:01,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash 383287922, now seen corresponding path program 1 times [2023-12-02 15:22:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:01,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113254356] [2023-12-02 15:22:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:01,087 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 [2023-12-02 15:22:01,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:01,088 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:01,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:01,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:22:01,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:01,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:01,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113254356] [2023-12-02 15:22:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113254356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:01,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:22:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427275357] [2023-12-02 15:22:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:22:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:22:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:22:01,298 INFO L87 Difference]: Start difference. First operand 658 states and 722 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2023-12-02 15:22:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:02,154 INFO L93 Difference]: Finished difference Result 652 states and 712 transitions. [2023-12-02 15:22:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:22:02,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2023-12-02 15:22:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:02,159 INFO L225 Difference]: With dead ends: 652 [2023-12-02 15:22:02,159 INFO L226 Difference]: Without dead ends: 652 [2023-12-02 15:22:02,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:22:02,160 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 23 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:02,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1669 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 15:22:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-12-02 15:22:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2023-12-02 15:22:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 327 states have (on average 2.159021406727829) internal successors, (706), 647 states have internal predecessors, (706), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 712 transitions. [2023-12-02 15:22:02,170 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 712 transitions. Word has length 43 [2023-12-02 15:22:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 712 transitions. [2023-12-02 15:22:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2023-12-02 15:22:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 712 transitions. [2023-12-02 15:22:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 15:22:02,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:02,172 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] [2023-12-02 15:22:02,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:02,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:02,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:02,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1274164115, now seen corresponding path program 1 times [2023-12-02 15:22:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954529943] [2023-12-02 15:22:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:02,376 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 [2023-12-02 15:22:02,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:02,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:02,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:02,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:22:02,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:02,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:02,826 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954529943] [2023-12-02 15:22:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954529943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:02,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:02,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:22:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886202322] [2023-12-02 15:22:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:02,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:22:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:22:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:22:02,828 INFO L87 Difference]: Start difference. First operand 652 states and 712 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) [2023-12-02 15:22:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:03,777 INFO L93 Difference]: Finished difference Result 876 states and 945 transitions. [2023-12-02 15:22:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:22:03,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2023-12-02 15:22:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:03,785 INFO L225 Difference]: With dead ends: 876 [2023-12-02 15:22:03,785 INFO L226 Difference]: Without dead ends: 876 [2023-12-02 15:22:03,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:22:03,786 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 246 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:03,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1093 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:22:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-12-02 15:22:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 696. [2023-12-02 15:22:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 371 states have (on average 2.0215633423180592) internal successors, (750), 691 states have internal predecessors, (750), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 756 transitions. [2023-12-02 15:22:03,804 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 756 transitions. Word has length 47 [2023-12-02 15:22:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:03,804 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 756 transitions. [2023-12-02 15:22:03,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) [2023-12-02 15:22:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 756 transitions. [2023-12-02 15:22:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 15:22:03,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:03,806 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] [2023-12-02 15:22:03,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:04,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:04,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -405287895, now seen corresponding path program 1 times [2023-12-02 15:22:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830362082] [2023-12-02 15:22:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:04,012 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 [2023-12-02 15:22:04,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:04,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:04,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:04,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:22:04,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:04,421 INFO L378 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 [2023-12-02 15:22:04,427 INFO L378 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 [2023-12-02 15:22:04,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:04,961 INFO L378 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 14 treesize of output 9 [2023-12-02 15:22:04,979 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:22:04,980 INFO L378 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 [2023-12-02 15:22:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:04,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:04,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830362082] [2023-12-02 15:22:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830362082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:22:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077973487] [2023-12-02 15:22:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:05,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:22:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:05,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:22:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:22:05,001 INFO L87 Difference]: Start difference. First operand 696 states and 756 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:07,132 INFO L93 Difference]: Finished difference Result 668 states and 729 transitions. [2023-12-02 15:22:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:22:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-02 15:22:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:07,136 INFO L225 Difference]: With dead ends: 668 [2023-12-02 15:22:07,136 INFO L226 Difference]: Without dead ends: 668 [2023-12-02 15:22:07,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:22:07,137 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 354 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:07,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 425 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 15:22:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-02 15:22:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 635. [2023-12-02 15:22:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 661 transitions. [2023-12-02 15:22:07,153 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 661 transitions. Word has length 50 [2023-12-02 15:22:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:07,153 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 661 transitions. [2023-12-02 15:22:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 661 transitions. [2023-12-02 15:22:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 15:22:07,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:07,154 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] [2023-12-02 15:22:07,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:07,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:07,356 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:07,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1731461989, now seen corresponding path program 1 times [2023-12-02 15:22:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527527677] [2023-12-02 15:22:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:07,357 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 [2023-12-02 15:22:07,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:07,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:07,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:07,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:22:07,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:07,576 INFO L378 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 [2023-12-02 15:22:07,602 INFO L378 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 19 treesize of output 1 [2023-12-02 15:22:07,608 INFO L378 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 [2023-12-02 15:22:07,660 INFO L378 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 [2023-12-02 15:22:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:07,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:07,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:07,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527527677] [2023-12-02 15:22:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527527677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:07,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:22:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605453020] [2023-12-02 15:22:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:07,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:22:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:22:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:22:07,684 INFO L87 Difference]: Start difference. First operand 635 states and 661 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:10,698 INFO L93 Difference]: Finished difference Result 634 states and 660 transitions. [2023-12-02 15:22:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:22:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 15:22:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:10,703 INFO L225 Difference]: With dead ends: 634 [2023-12-02 15:22:10,703 INFO L226 Difference]: Without dead ends: 634 [2023-12-02 15:22:10,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:22:10,704 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 3 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:10,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1369 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 15:22:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-12-02 15:22:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2023-12-02 15:22:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 348 states have (on average 1.8793103448275863) internal successors, (654), 629 states have internal predecessors, (654), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 660 transitions. [2023-12-02 15:22:10,719 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 660 transitions. Word has length 54 [2023-12-02 15:22:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:10,719 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 660 transitions. [2023-12-02 15:22:10,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 660 transitions. [2023-12-02 15:22:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 15:22:10,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:10,721 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] [2023-12-02 15:22:10,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:10,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:10,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:10,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1731461990, now seen corresponding path program 1 times [2023-12-02 15:22:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167360067] [2023-12-02 15:22:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:10,928 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 [2023-12-02 15:22:10,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:10,929 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:10,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:11,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:22:11,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:11,155 INFO L378 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 [2023-12-02 15:22:11,175 INFO L378 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 19 treesize of output 1 [2023-12-02 15:22:11,199 INFO L378 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 [2023-12-02 15:22:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:11,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:11,208 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:11,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167360067] [2023-12-02 15:22:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167360067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:11,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:22:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859141488] [2023-12-02 15:22:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:22:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:11,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:22:11,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:22:11,209 INFO L87 Difference]: Start difference. First operand 634 states and 660 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:13,600 INFO L93 Difference]: Finished difference Result 633 states and 659 transitions. [2023-12-02 15:22:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:22:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 15:22:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:13,604 INFO L225 Difference]: With dead ends: 633 [2023-12-02 15:22:13,604 INFO L226 Difference]: Without dead ends: 633 [2023-12-02 15:22:13,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:22:13,605 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:13,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1343 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 15:22:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-12-02 15:22:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2023-12-02 15:22:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 347 states have (on average 1.8818443804034581) internal successors, (653), 628 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:22:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 659 transitions. [2023-12-02 15:22:13,620 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 659 transitions. Word has length 54 [2023-12-02 15:22:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:13,620 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 659 transitions. [2023-12-02 15:22:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:22:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 659 transitions. [2023-12-02 15:22:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 15:22:13,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:13,622 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] [2023-12-02 15:22:13,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:13,822 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:13,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1270345792, now seen corresponding path program 1 times [2023-12-02 15:22:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456687985] [2023-12-02 15:22:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:13,824 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 [2023-12-02 15:22:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:13,825 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:13,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:14,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:22:14,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:14,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:14,055 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456687985] [2023-12-02 15:22:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456687985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:14,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:22:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051837058] [2023-12-02 15:22:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:14,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:22:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:22:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:22:14,057 INFO L87 Difference]: Start difference. First operand 633 states and 659 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-12-02 15:22:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:14,899 INFO L93 Difference]: Finished difference Result 635 states and 662 transitions. [2023-12-02 15:22:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:22:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2023-12-02 15:22:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:14,907 INFO L225 Difference]: With dead ends: 635 [2023-12-02 15:22:14,907 INFO L226 Difference]: Without dead ends: 635 [2023-12-02 15:22:14,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:22:14,908 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:14,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1608 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 15:22:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-12-02 15:22:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2023-12-02 15:22:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:22:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 662 transitions. [2023-12-02 15:22:14,924 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 662 transitions. Word has length 60 [2023-12-02 15:22:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:14,924 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 662 transitions. [2023-12-02 15:22:14,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-12-02 15:22:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 662 transitions. [2023-12-02 15:22:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 15:22:14,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:14,925 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] [2023-12-02 15:22:14,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:15,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:15,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:15,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -981616399, now seen corresponding path program 1 times [2023-12-02 15:22:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:15,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009504816] [2023-12-02 15:22:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:15,127 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 [2023-12-02 15:22:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:15,128 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:15,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:15,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:22:15,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:15,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:15,528 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009504816] [2023-12-02 15:22:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009504816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1164105128] [2023-12-02 15:22:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:15,529 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:22:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:22:15,530 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:22:15,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 15:22:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:15,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:22:15,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:15,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1164105128] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071852407] [2023-12-02 15:22:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:15,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:22:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:22:15,979 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:22:15,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 15:22:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:16,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:22:16,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:16,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071852407] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:16,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:22:16,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 15:22:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116378890] [2023-12-02 15:22:16,239 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:22:16,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:22:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:22:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:22:16,240 INFO L87 Difference]: Start difference. First operand 635 states and 662 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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) [2023-12-02 15:22:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:17,829 INFO L93 Difference]: Finished difference Result 644 states and 676 transitions. [2023-12-02 15:22:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:22:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2023-12-02 15:22:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:17,833 INFO L225 Difference]: With dead ends: 644 [2023-12-02 15:22:17,833 INFO L226 Difference]: Without dead ends: 644 [2023-12-02 15:22:17,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:22:17,834 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 6 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:17,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3206 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 15:22:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-02 15:22:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2023-12-02 15:22:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 355 states have (on average 1.8816901408450704) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:22:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 675 transitions. [2023-12-02 15:22:17,847 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 675 transitions. Word has length 61 [2023-12-02 15:22:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:17,847 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 675 transitions. [2023-12-02 15:22:17,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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) [2023-12-02 15:22:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 675 transitions. [2023-12-02 15:22:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 15:22:17,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:17,848 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] [2023-12-02 15:22:17,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 15:22:18,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:18,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 15:22:18,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:22:18,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:18,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1933382784, now seen corresponding path program 2 times [2023-12-02 15:22:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780084102] [2023-12-02 15:22:18,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:22:18,450 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 [2023-12-02 15:22:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:18,451 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:18,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:18,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:22:18,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:22:18,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:22:18,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:18,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:19,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780084102] [2023-12-02 15:22:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780084102] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1995185024] [2023-12-02 15:22:19,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:22:19,077 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:22:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:22:19,078 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:22:19,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 15:22:19,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:22:19,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:22:19,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:22:19,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:19,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1995185024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032607348] [2023-12-02 15:22:19,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:22:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:22:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:22:19,967 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:22:19,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 15:22:43,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:22:43,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:22:43,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:22:43,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:44,006 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:22:44,006 INFO L378 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 [2023-12-02 15:22:44,045 INFO L378 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 19 treesize of output 1 [2023-12-02 15:22:44,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:22:44,351 INFO L378 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 44 treesize of output 43 [2023-12-02 15:22:44,424 INFO L378 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 [2023-12-02 15:22:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:22:44,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:44,577 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:22:44,578 INFO L378 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 [2023-12-02 15:22:44,587 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem34#1.base|)) is different from false [2023-12-02 15:22:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032607348] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:22:44,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:22:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 15:22:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050320910] [2023-12-02 15:22:44,591 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:22:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 15:22:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 15:22:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2023-12-02 15:22:44,593 INFO L87 Difference]: Start difference. First operand 643 states and 675 transitions. Second operand has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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) [2023-12-02 15:22:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:53,120 INFO L93 Difference]: Finished difference Result 667 states and 707 transitions. [2023-12-02 15:22:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 15:22:53,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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 64 [2023-12-02 15:22:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:53,124 INFO L225 Difference]: With dead ends: 667 [2023-12-02 15:22:53,124 INFO L226 Difference]: Without dead ends: 665 [2023-12-02 15:22:53,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=455, Invalid=2410, Unknown=1, NotChecked=104, Total=2970 [2023-12-02 15:22:53,125 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 392 mSDsluCounter, 4578 mSDsCounter, 0 mSdLazyCounter, 4775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4935 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:53,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4935 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4775 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-02 15:22:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-02 15:22:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 651. [2023-12-02 15:22:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 364 states have (on average 1.8653846153846154) internal successors, (679), 645 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:22:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 686 transitions. [2023-12-02 15:22:53,135 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 686 transitions. Word has length 64 [2023-12-02 15:22:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:53,135 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 686 transitions. [2023-12-02 15:22:53,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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) [2023-12-02 15:22:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 686 transitions. [2023-12-02 15:22:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 15:22:53,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:53,136 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] [2023-12-02 15:22:53,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 15:22:53,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 15:22:53,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:22:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:53,737 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:22:53,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 686231265, now seen corresponding path program 1 times [2023-12-02 15:22:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765250924] [2023-12-02 15:22:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:53,739 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 [2023-12-02 15:22:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:53,740 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:22:53,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:22:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:54,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:22:54,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:54,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:54,588 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765250924] [2023-12-02 15:22:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765250924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1440982943] [2023-12-02 15:22:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:22:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:22:54,589 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:22:54,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 15:22:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:55,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:22:55,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:55,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1440982943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987709474] [2023-12-02 15:22:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:22:55,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:22:55,174 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:22:55,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 15:22:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:55,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 15:22:55,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:55,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:22:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987709474] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:56,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:22:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 15:22:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865019447] [2023-12-02 15:22:56,212 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:22:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:22:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:22:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 15:22:56,214 INFO L87 Difference]: Start difference. First operand 651 states and 686 transitions. Second operand has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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) [2023-12-02 15:23:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:23:01,928 INFO L93 Difference]: Finished difference Result 681 states and 731 transitions. [2023-12-02 15:23:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 15:23:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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 70 [2023-12-02 15:23:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:23:01,932 INFO L225 Difference]: With dead ends: 681 [2023-12-02 15:23:01,932 INFO L226 Difference]: Without dead ends: 678 [2023-12-02 15:23:01,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 15:23:01,934 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 26 mSDsluCounter, 8522 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9056 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:23:01,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9056 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 15:23:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-12-02 15:23:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 669. [2023-12-02 15:23:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 382 states have (on average 1.837696335078534) internal successors, (702), 663 states have internal predecessors, (702), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:23:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 709 transitions. [2023-12-02 15:23:01,945 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 709 transitions. Word has length 70 [2023-12-02 15:23:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:23:01,946 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 709 transitions. [2023-12-02 15:23:01,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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) [2023-12-02 15:23:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 709 transitions. [2023-12-02 15:23:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-02 15:23:01,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:23:01,947 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] [2023-12-02 15:23:01,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:23:02,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 15:23:02,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 15:23:02,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:23:02,548 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:23:02,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:23:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -844551263, now seen corresponding path program 2 times [2023-12-02 15:23:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:23:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47323354] [2023-12-02 15:23:02,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:23:02,549 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 [2023-12-02 15:23:02,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:23:02,550 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:23:02,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:23:02,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:23:02,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:23:02,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:23:02,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:23:03,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:23:05,565 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:23:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47323354] [2023-12-02 15:23:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47323354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:23:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371353881] [2023-12-02 15:23:05,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:23:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:23:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:23:05,566 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:23:05,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 15:23:06,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:23:06,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:23:06,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:23:06,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:23:06,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:23:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1371353881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:23:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247264150] [2023-12-02 15:23:07,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:23:07,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:23:07,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:23:07,130 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:23:07,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 15:23:18,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:23:18,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:23:18,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 15:23:18,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:18,545 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:23:18,545 INFO L378 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 [2023-12-02 15:23:18,552 INFO L378 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 [2023-12-02 15:23:18,688 INFO L378 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 19 treesize of output 1 [2023-12-02 15:23:18,701 INFO L378 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 [2023-12-02 15:23:19,053 INFO L378 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 [2023-12-02 15:23:19,057 INFO L378 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 [2023-12-02 15:23:19,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:23:19,630 INFO L378 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 62 treesize of output 57 [2023-12-02 15:23:19,640 INFO L378 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 30 treesize of output 13 [2023-12-02 15:23:19,813 INFO L378 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 [2023-12-02 15:23:19,820 INFO L378 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 [2023-12-02 15:23:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 15:23:19,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:20,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 15:23:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247264150] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:23:20,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:23:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 15:23:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452934248] [2023-12-02 15:23:20,774 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:23:20,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 15:23:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:23:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 15:23:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 15:23:20,777 INFO L87 Difference]: Start difference. First operand 669 states and 709 transitions. Second operand has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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) [2023-12-02 15:23:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:23:55,379 INFO L93 Difference]: Finished difference Result 741 states and 822 transitions. [2023-12-02 15:23:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-02 15:23:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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 82 [2023-12-02 15:23:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:23:55,385 INFO L225 Difference]: With dead ends: 741 [2023-12-02 15:23:55,385 INFO L226 Difference]: Without dead ends: 734 [2023-12-02 15:23:55,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3457, Invalid=16568, Unknown=1, NotChecked=280, Total=20306 [2023-12-02 15:23:55,393 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 430 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 11827 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 9855 SdHoareTripleChecker+Invalid, 11886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 11827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:23:55,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 9855 Invalid, 11886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 11827 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2023-12-02 15:23:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-12-02 15:23:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 704. [2023-12-02 15:23:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 418 states have (on average 1.7822966507177034) internal successors, (745), 698 states have internal predecessors, (745), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:23:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 752 transitions. [2023-12-02 15:23:55,417 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 752 transitions. Word has length 82 [2023-12-02 15:23:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:23:55,417 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 752 transitions. [2023-12-02 15:23:55,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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) [2023-12-02 15:23:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 752 transitions. [2023-12-02 15:23:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 15:23:55,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:23:55,419 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] [2023-12-02 15:23:55,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:23:55,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 15:23:55,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 15:23:56,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:23:56,020 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:23:56,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:23:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1159176842, now seen corresponding path program 1 times [2023-12-02 15:23:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:23:56,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152666591] [2023-12-02 15:23:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:56,021 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 [2023-12-02 15:23:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:23:56,022 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:23:56,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:23:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:23:56,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 15:23:56,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:56,754 INFO L378 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 [2023-12-02 15:23:56,857 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:23:56,857 INFO L378 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 [2023-12-02 15:23:56,890 INFO L378 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 19 treesize of output 1 [2023-12-02 15:23:56,981 INFO L378 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 [2023-12-02 15:23:57,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:23:57,910 INFO L378 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 44 treesize of output 43 [2023-12-02 15:23:58,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:23:58,014 INFO L378 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 44 treesize of output 43 [2023-12-02 15:23:58,028 INFO L378 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 [2023-12-02 15:23:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:23:58,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:58,120 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2869) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:23:58,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (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_2869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:23:58,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2869 (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~mem34#1.base| v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:23:58,513 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:23:58,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152666591] [2023-12-02 15:23:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152666591] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:23:58,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [190813197] [2023-12-02 15:23:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:58,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:23:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:23:58,514 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:23:58,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 15:24:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:01,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:24:01,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:01,555 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:24:01,555 INFO L378 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 14 treesize of output 20 [2023-12-02 15:24:02,008 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:24:02,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 15:24:02,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:24:02,273 INFO L378 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 28 treesize of output 16 [2023-12-02 15:24:03,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:24:03,547 INFO L378 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 44 treesize of output 41 [2023-12-02 15:24:03,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:24:03,730 INFO L378 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 44 treesize of output 41 [2023-12-02 15:24:03,748 INFO L378 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 35 treesize of output 19 [2023-12-02 15:24:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:24:03,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:24:05,898 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (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_3322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:24:06,268 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3368))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:24:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [190813197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:24:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134318986] [2023-12-02 15:24:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:06,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:24:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:24:06,272 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:24:06,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 15:24:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:06,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 15:24:06,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:06,880 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:24:06,880 INFO L378 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 [2023-12-02 15:24:06,917 INFO L378 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 19 treesize of output 1 [2023-12-02 15:24:07,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:24:07,301 INFO L378 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 31 treesize of output 32 [2023-12-02 15:24:07,404 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:24:07,405 INFO L378 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 44 treesize of output 43 [2023-12-02 15:24:07,480 INFO L378 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 [2023-12-02 15:24:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:24:07,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:24:07,508 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:24:07,509 INFO L378 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 [2023-12-02 15:24:07,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3773) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 15:24:07,528 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (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_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 15:24:07,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3819)) (.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_3773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 15:24:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134318986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:24:07,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:24:07,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2023-12-02 15:24:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902251183] [2023-12-02 15:24:07,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:24:07,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 15:24:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:24:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 15:24:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=740, Unknown=13, NotChecked=504, Total=1406 [2023-12-02 15:24:07,950 INFO L87 Difference]: Start difference. First operand 704 states and 752 transitions. Second operand has 28 states, 24 states have (on average 6.833333333333333) internal successors, (164), 28 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:24:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:24:16,171 INFO L93 Difference]: Finished difference Result 1308 states and 1402 transitions. [2023-12-02 15:24:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 15:24:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 6.833333333333333) internal successors, (164), 28 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 106 [2023-12-02 15:24:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:24:16,178 INFO L225 Difference]: With dead ends: 1308 [2023-12-02 15:24:16,178 INFO L226 Difference]: Without dead ends: 1308 [2023-12-02 15:24:16,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=207, Invalid=1144, Unknown=13, NotChecked=616, Total=1980 [2023-12-02 15:24:16,179 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 1129 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 4155 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:24:16,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 3074 Invalid, 4182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4155 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-02 15:24:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-12-02 15:24:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 703. [2023-12-02 15:24:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 418 states have (on average 1.7799043062200957) internal successors, (744), 697 states have internal predecessors, (744), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:24:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 751 transitions. [2023-12-02 15:24:16,192 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 751 transitions. Word has length 106 [2023-12-02 15:24:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:24:16,192 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 751 transitions. [2023-12-02 15:24:16,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 6.833333333333333) internal successors, (164), 28 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:24:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 751 transitions. [2023-12-02 15:24:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 15:24:16,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:24:16,193 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] [2023-12-02 15:24:16,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:24:16,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 15:24:16,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 15:24:16,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:24:16,794 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:24:16,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:24:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1159176841, now seen corresponding path program 1 times [2023-12-02 15:24:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:24:16,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954763674] [2023-12-02 15:24:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:16,796 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 [2023-12-02 15:24:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:24:16,797 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:24:16,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:24:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:17,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 15:24:17,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:17,576 INFO L378 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 [2023-12-02 15:24:17,667 INFO L378 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 [2023-12-02 15:24:17,678 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:24:17,679 INFO L378 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 [2023-12-02 15:24:17,705 INFO L378 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 [2023-12-02 15:24:17,717 INFO L378 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 19 treesize of output 1 [2023-12-02 15:24:17,818 INFO L378 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 [2023-12-02 15:24:17,823 INFO L378 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 [2023-12-02 15:24:18,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:24:18,568 INFO L378 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 62 treesize of output 57 [2023-12-02 15:24:18,573 INFO L378 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 30 treesize of output 13 [2023-12-02 15:24:18,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:24:18,675 INFO L378 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 62 treesize of output 57 [2023-12-02 15:24:18,681 INFO L378 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 30 treesize of output 13 [2023-12-02 15:24:18,701 INFO L378 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 [2023-12-02 15:24:18,707 INFO L378 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 [2023-12-02 15:24:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:24:18,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:24:18,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4272) |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~mem36#1.base| v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:24:18,926 WARN L854 $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_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:24:20,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4364) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4365) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4365))) (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~mem34#1.base| v_ArrVal_4364) .cse2 v_ArrVal_4272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:24:20,284 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:24:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954763674] [2023-12-02 15:24:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954763674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:24:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [572672779] [2023-12-02 15:24:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:20,285 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:24:20,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:24:20,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:24:20,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 15:26:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:26:17,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 15:26:17,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:26:17,085 INFO L378 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 [2023-12-02 15:26:17,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:26:17,339 INFO L378 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 [2023-12-02 15:26:17,346 INFO L378 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 [2023-12-02 15:26:17,398 INFO L378 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 15 treesize of output 1 [2023-12-02 15:26:17,408 INFO L378 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 11 treesize of output 7 [2023-12-02 15:26:17,535 INFO L378 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 18 treesize of output 10 [2023-12-02 15:26:17,540 INFO L378 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 7 treesize of output 3 [2023-12-02 15:26:18,115 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:26:18,116 INFO L378 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 50 treesize of output 45 [2023-12-02 15:26:18,125 INFO L378 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 24 treesize of output 11 [2023-12-02 15:26:18,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:26:18,259 INFO L378 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 50 treesize of output 45 [2023-12-02 15:26:18,268 INFO L378 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 24 treesize of output 11 [2023-12-02 15:26:18,281 INFO L378 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 25 treesize of output 13 [2023-12-02 15:26:18,285 INFO L378 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 7 treesize of output 3 [2023-12-02 15:26:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:26:18,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:26:18,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 15:26:18,369 WARN L854 $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_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 15:26:19,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4911))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4910) .cse0 v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4910) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 15:26:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [572672779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:26:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082691864] [2023-12-02 15:26:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:26:19,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:26:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:26:19,669 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:26:19,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 15:26:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:26:20,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 15:26:20,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:26:20,280 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:26:20,280 INFO L378 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 [2023-12-02 15:26:20,285 INFO L378 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 [2023-12-02 15:26:20,294 INFO L378 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 19 treesize of output 1 [2023-12-02 15:26:20,304 INFO L378 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 [2023-12-02 15:26:20,354 INFO L378 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 [2023-12-02 15:26:20,359 INFO L378 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 [2023-12-02 15:26:20,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:26:20,951 INFO L378 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 62 treesize of output 57 [2023-12-02 15:26:20,960 INFO L378 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 30 treesize of output 13 [2023-12-02 15:26:21,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:26:21,036 INFO L378 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 62 treesize of output 57 [2023-12-02 15:26:21,046 INFO L378 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 30 treesize of output 13 [2023-12-02 15:26:21,057 INFO L378 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 [2023-12-02 15:26:21,061 INFO L378 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 [2023-12-02 15:26:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:26:21,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:26:21,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 15:26:21,154 WARN L854 $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_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 15:26:22,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5455))) (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~mem34#1.base| v_ArrVal_5456) .cse0 v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5456) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 15:26:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082691864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:26:22,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:26:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15 [2023-12-02 15:26:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028482742] [2023-12-02 15:26:22,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:26:22,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:26:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:26:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:26:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=263, Unknown=9, NotChecked=360, Total=702 [2023-12-02 15:26:22,441 INFO L87 Difference]: Start difference. First operand 703 states and 751 transitions. Second operand has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:26:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:26:31,240 INFO L93 Difference]: Finished difference Result 712 states and 761 transitions. [2023-12-02 15:26:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:26:31,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-12-02 15:26:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:26:31,243 INFO L225 Difference]: With dead ends: 712 [2023-12-02 15:26:31,243 INFO L226 Difference]: Without dead ends: 712 [2023-12-02 15:26:31,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 303 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=461, Unknown=9, NotChecked=468, Total=1056 [2023-12-02 15:26:31,244 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 640 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 4537 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 4553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:26:31,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 2398 Invalid, 4553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4537 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-12-02 15:26:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2023-12-02 15:26:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 702. [2023-12-02 15:26:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 418 states have (on average 1.777511961722488) internal successors, (743), 696 states have internal predecessors, (743), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:26:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 750 transitions. [2023-12-02 15:26:31,254 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 750 transitions. Word has length 106 [2023-12-02 15:26:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:26:31,254 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 750 transitions. [2023-12-02 15:26:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:26:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 750 transitions. [2023-12-02 15:26:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 15:26:31,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:26:31,255 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] [2023-12-02 15:26:31,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-12-02 15:26:31,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:26:31,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 15:26:31,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:26:31,856 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:26:31,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:26:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1571471162, now seen corresponding path program 1 times [2023-12-02 15:26:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:26:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055569369] [2023-12-02 15:26:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:26:31,857 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 [2023-12-02 15:26:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:26:31,858 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:26:31,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:26:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:26:32,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 15:26:32,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:26:32,737 INFO L378 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 [2023-12-02 15:26:32,831 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:26:32,832 INFO L378 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 [2023-12-02 15:26:32,861 INFO L378 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 19 treesize of output 1 [2023-12-02 15:26:32,932 INFO L378 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 [2023-12-02 15:26:33,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:26:33,774 INFO L378 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 44 treesize of output 43 [2023-12-02 15:26:33,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:26:33,878 INFO L378 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 44 treesize of output 43 [2023-12-02 15:26:33,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:26:33,951 INFO L378 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 44 treesize of output 43 [2023-12-02 15:26:33,964 INFO L378 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 [2023-12-02 15:26:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:26:33,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:26:36,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 15:26:36,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:26:36,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (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_5878))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:26:36,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5879 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5925))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5878)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:26:36,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:26:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055569369] [2023-12-02 15:26:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055569369] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:26:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940074759] [2023-12-02 15:26:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:26:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:26:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:26:36,446 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:26:36,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 15:27:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:00,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 15:27:00,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:00,333 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:27:00,333 INFO L378 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 14 treesize of output 20 [2023-12-02 15:27:00,763 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:27:00,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 15:27:00,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:27:01,027 INFO L378 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 28 treesize of output 16 [2023-12-02 15:27:02,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:27:02,345 INFO L378 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 44 treesize of output 41 [2023-12-02 15:27:02,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:27:02,527 INFO L378 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 44 treesize of output 41 [2023-12-02 15:27:02,655 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:27:02,655 INFO L378 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 44 treesize of output 41 [2023-12-02 15:27:02,679 INFO L378 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 35 treesize of output 19 [2023-12-02 15:27:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:27:02,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:02,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6348) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:27:02,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6348 (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_6348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:27:02,793 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6348 (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~mem36#1.base| v_ArrVal_6347))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6348)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:27:02,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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_6347))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6348)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:27:03,187 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6348 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6394))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6347)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6348)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:27:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [940074759] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278711696] [2023-12-02 15:27:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:03,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:03,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:03,192 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:03,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 15:27:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:03,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 15:27:03,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:03,905 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:27:03,905 INFO L378 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 [2023-12-02 15:27:03,945 INFO L378 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 19 treesize of output 1 [2023-12-02 15:27:04,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:04,338 INFO L378 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 31 treesize of output 32 [2023-12-02 15:27:04,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:04,424 INFO L378 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 31 treesize of output 32 [2023-12-02 15:27:04,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:04,514 INFO L378 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 44 treesize of output 43 [2023-12-02 15:27:04,580 INFO L378 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 [2023-12-02 15:27:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:27:04,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:04,607 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:27:04,607 INFO L378 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 [2023-12-02 15:27:04,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6815 (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))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2023-12-02 15:27:04,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6814)) (.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_6815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 15:27:04,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6814))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:27:05,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6861 (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~mem34#1.base| v_ArrVal_6861))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6814)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:27:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278711696] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:05,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:27:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 30 [2023-12-02 15:27:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654632294] [2023-12-02 15:27:05,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:27:05,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 15:27:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:27:05,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 15:27:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=957, Unknown=30, NotChecked=988, Total=2162 [2023-12-02 15:27:05,115 INFO L87 Difference]: Start difference. First operand 702 states and 750 transitions. Second operand has 31 states, 27 states have (on average 6.296296296296297) internal successors, (170), 31 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:27:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:16,041 INFO L93 Difference]: Finished difference Result 1304 states and 1398 transitions. [2023-12-02 15:27:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 15:27:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.296296296296297) internal successors, (170), 31 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 108 [2023-12-02 15:27:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:16,047 INFO L225 Difference]: With dead ends: 1304 [2023-12-02 15:27:16,047 INFO L226 Difference]: Without dead ends: 1304 [2023-12-02 15:27:16,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=246, Invalid=1414, Unknown=32, NotChecked=1170, Total=2862 [2023-12-02 15:27:16,049 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 1393 mSDsluCounter, 3711 mSDsCounter, 0 mSdLazyCounter, 5263 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 3991 SdHoareTripleChecker+Invalid, 5292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:16,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 3991 Invalid, 5292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5263 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-12-02 15:27:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2023-12-02 15:27:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 701. [2023-12-02 15:27:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 418 states have (on average 1.7751196172248804) internal successors, (742), 695 states have internal predecessors, (742), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:27:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 749 transitions. [2023-12-02 15:27:16,062 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 749 transitions. Word has length 108 [2023-12-02 15:27:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 749 transitions. [2023-12-02 15:27:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.296296296296297) internal successors, (170), 31 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:27:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 749 transitions. [2023-12-02 15:27:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 15:27:16,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:16,063 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] [2023-12-02 15:27:16,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 15:27:16,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 15:27:16,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:27:16,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:27:16,664 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:27:16,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1571471161, now seen corresponding path program 1 times [2023-12-02 15:27:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:27:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243980830] [2023-12-02 15:27:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:16,666 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 [2023-12-02 15:27:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:27:16,666 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:27:16,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:27:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:17,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 15:27:17,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:17,635 INFO L378 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 [2023-12-02 15:27:17,738 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:27:17,739 INFO L378 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 [2023-12-02 15:27:17,744 INFO L378 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 [2023-12-02 15:27:17,764 INFO L378 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 19 treesize of output 1 [2023-12-02 15:27:17,782 INFO L378 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 [2023-12-02 15:27:17,875 INFO L378 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 [2023-12-02 15:27:17,879 INFO L378 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 [2023-12-02 15:27:18,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:18,537 INFO L378 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 62 treesize of output 57 [2023-12-02 15:27:18,549 INFO L378 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 30 treesize of output 13 [2023-12-02 15:27:18,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:18,657 INFO L378 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 62 treesize of output 57 [2023-12-02 15:27:18,666 INFO L378 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 30 treesize of output 13 [2023-12-02 15:27:18,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:27:18,756 INFO L378 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 62 treesize of output 57 [2023-12-02 15:27:18,762 INFO L378 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 30 treesize of output 13 [2023-12-02 15:27:18,781 INFO L378 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 [2023-12-02 15:27:18,788 INFO L378 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 [2023-12-02 15:27:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:27:18,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:18,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-12-02 15:27:19,013 WARN L854 $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_7331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 15:27:19,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7330) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329))) (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~mem36#1.base| v_ArrVal_7330) .cse2 v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:27:19,282 WARN L854 $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_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7330) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7329))) (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_7330) .cse3 v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 15:27:21,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7424))) (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~mem34#1.base| v_ArrVal_7423) .cse1 v_ArrVal_7330) (select (select (store .cse2 .cse1 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7331))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7424))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7329))) (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~mem34#1.base| v_ArrVal_7423) .cse4 v_ArrVal_7330) .cse5 v_ArrVal_7331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:27:21,313 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:27:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243980830] [2023-12-02 15:27:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243980830] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1187595488] [2023-12-02 15:27:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:27:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:27:21,314 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:27:21,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 15:28:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:19,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 15:28:19,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:19,917 INFO L378 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 [2023-12-02 15:28:20,397 INFO L378 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 [2023-12-02 15:28:20,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:28:20,425 INFO L378 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 [2023-12-02 15:28:20,509 INFO L378 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 15 treesize of output 1 [2023-12-02 15:28:20,528 INFO L378 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 11 treesize of output 7 [2023-12-02 15:28:20,762 INFO L378 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 18 treesize of output 10 [2023-12-02 15:28:20,768 INFO L378 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 7 treesize of output 3 [2023-12-02 15:28:21,694 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:28:21,695 INFO L378 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 50 treesize of output 45 [2023-12-02 15:28:21,702 INFO L378 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 24 treesize of output 11 [2023-12-02 15:28:21,953 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:28:21,953 INFO L378 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 50 treesize of output 45 [2023-12-02 15:28:21,969 INFO L378 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 24 treesize of output 11 [2023-12-02 15:28:22,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:28:22,121 INFO L378 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 50 treesize of output 45 [2023-12-02 15:28:22,128 INFO L378 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 24 treesize of output 11 [2023-12-02 15:28:22,154 INFO L378 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 25 treesize of output 13 [2023-12-02 15:28:22,165 INFO L378 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 7 treesize of output 3 [2023-12-02 15:28:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:28:22,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:28:22,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 15:28:22,274 WARN L854 $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_7895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 15:28:22,332 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7892))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7893) .cse0 v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7893) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 15:28:26,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7986))) (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~mem34#1.base| v_ArrVal_7987) .cse1 v_ArrVal_7893) (select (select (store .cse2 .cse1 v_ArrVal_7892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7894))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7986))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7892))) (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~mem34#1.base| v_ArrVal_7987) .cse4 v_ArrVal_7893) .cse5 v_ArrVal_7894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:28:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1187595488] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410262310] [2023-12-02 15:28:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:28:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:28:26,060 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:28:26,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 15:28:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:26,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 15:28:26,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:26,941 INFO L378 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 [2023-12-02 15:28:26,963 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:28:26,964 INFO L378 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 [2023-12-02 15:28:26,978 INFO L378 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 [2023-12-02 15:28:27,001 INFO L378 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 19 treesize of output 1 [2023-12-02 15:28:27,073 INFO L378 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 [2023-12-02 15:28:27,079 INFO L378 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 [2023-12-02 15:28:28,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:28,058 INFO L378 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 62 treesize of output 57 [2023-12-02 15:28:28,080 INFO L378 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 30 treesize of output 13 [2023-12-02 15:28:28,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:28,192 INFO L378 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 62 treesize of output 57 [2023-12-02 15:28:28,212 INFO L378 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 30 treesize of output 13 [2023-12-02 15:28:28,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:28,291 INFO L378 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 62 treesize of output 57 [2023-12-02 15:28:28,305 INFO L378 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 30 treesize of output 13 [2023-12-02 15:28:28,329 INFO L378 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 [2023-12-02 15:28:28,342 INFO L378 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 [2023-12-02 15:28:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:28:28,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:28:28,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 15:28:28,448 WARN L854 $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_8456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:28:28,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8454) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8455))) (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~mem36#1.base| v_ArrVal_8454) .cse2 v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:28:28,654 WARN L854 $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_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8454) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8455))) (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_8454) .cse3 v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 15:28:30,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8549))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8455))) (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~mem34#1.base| v_ArrVal_8548) .cse0 v_ArrVal_8454) .cse1 v_ArrVal_8456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8549))) (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~mem34#1.base| v_ArrVal_8548) .cse6 v_ArrVal_8454) (select (select (store .cse7 .cse6 v_ArrVal_8455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8456))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 15:28:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410262310] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:30,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:28:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 17 [2023-12-02 15:28:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318218572] [2023-12-02 15:28:30,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:28:30,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 15:28:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:28:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 15:28:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=356, Unknown=20, NotChecked=714, Total=1190 [2023-12-02 15:28:30,854 INFO L87 Difference]: Start difference. First operand 701 states and 749 transitions. Second operand has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:28:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:28:44,623 INFO L93 Difference]: Finished difference Result 710 states and 759 transitions. [2023-12-02 15:28:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:28:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-12-02 15:28:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:28:44,626 INFO L225 Difference]: With dead ends: 710 [2023-12-02 15:28:44,626 INFO L226 Difference]: Without dead ends: 710 [2023-12-02 15:28:44,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=163, Invalid=629, Unknown=20, NotChecked=910, Total=1722 [2023-12-02 15:28:44,628 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 633 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 4087 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:28:44,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2223 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4087 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2023-12-02 15:28:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-12-02 15:28:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 700. [2023-12-02 15:28:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 418 states have (on average 1.7727272727272727) internal successors, (741), 694 states have internal predecessors, (741), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:28:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 748 transitions. [2023-12-02 15:28:44,640 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 748 transitions. Word has length 108 [2023-12-02 15:28:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:28:44,640 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 748 transitions. [2023-12-02 15:28:44,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:28:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 748 transitions. [2023-12-02 15:28:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 15:28:44,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:28:44,641 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] [2023-12-02 15:28:44,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 15:28:44,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:28:45,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-12-02 15:28:45,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:28:45,242 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:28:45,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:28:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1645640304, now seen corresponding path program 1 times [2023-12-02 15:28:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:28:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946103880] [2023-12-02 15:28:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:45,243 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 [2023-12-02 15:28:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:28:45,244 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:28:45,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:28:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:46,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:28:46,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:46,299 INFO L378 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 [2023-12-02 15:28:46,539 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:28:46,539 INFO L378 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 [2023-12-02 15:28:46,584 INFO L378 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 19 treesize of output 1 [2023-12-02 15:28:46,736 INFO L378 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 [2023-12-02 15:28:48,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:48,086 INFO L378 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 44 treesize of output 43 [2023-12-02 15:28:48,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:48,269 INFO L378 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 44 treesize of output 43 [2023-12-02 15:28:48,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:48,402 INFO L378 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 44 treesize of output 43 [2023-12-02 15:28:48,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:28:48,546 INFO L378 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 44 treesize of output 43 [2023-12-02 15:28:48,565 INFO L378 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 [2023-12-02 15:28:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:28:48,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:28:48,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8988) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:28:48,754 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (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_8988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:28:48,776 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (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~mem37#1.base| v_ArrVal_8987))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:28:48,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8987))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:28:48,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (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~mem36#1.base| v_ArrVal_8986))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8987)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:28:48,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8987)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:28:49,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9034 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9034))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8987)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:28:49,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:28:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946103880] [2023-12-02 15:28:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946103880] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:28:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1398317286] [2023-12-02 15:28:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:28:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:28:49,344 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:28:49,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 15:30:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:02,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 15:30:02,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:02,230 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:30:02,230 INFO L378 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 14 treesize of output 20 [2023-12-02 15:30:03,074 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:30:03,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 15:30:03,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:30:03,567 INFO L378 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 28 treesize of output 16 [2023-12-02 15:30:05,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:05,612 INFO L378 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 44 treesize of output 41 [2023-12-02 15:30:05,963 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:05,963 INFO L378 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 44 treesize of output 41 [2023-12-02 15:30:06,198 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:06,199 INFO L378 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 44 treesize of output 41 [2023-12-02 15:30:06,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:06,417 INFO L378 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 44 treesize of output 41 [2023-12-02 15:30:06,444 INFO L378 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 35 treesize of output 19 [2023-12-02 15:30:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:30:06,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:06,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9473) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-12-02 15:30:06,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (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_9473) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:30:06,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (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~mem37#1.base| v_ArrVal_9472))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:30:06,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (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_9472))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:30:06,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9471 (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~mem36#1.base| v_ArrVal_9471))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:30:06,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9471 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9471))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:30:07,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9519 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9519))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9471)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:30:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1398317286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280037862] [2023-12-02 15:30:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:07,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:07,212 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:30:07,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 15:30:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:07,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:30:07,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:08,170 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:30:08,171 INFO L378 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 [2023-12-02 15:30:08,264 INFO L378 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 19 treesize of output 1 [2023-12-02 15:30:09,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:30:09,360 INFO L378 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 44 treesize of output 43 [2023-12-02 15:30:09,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:30:09,618 INFO L378 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 44 treesize of output 43 [2023-12-02 15:30:09,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:30:09,803 INFO L378 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 44 treesize of output 43 [2023-12-02 15:30:09,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:30:09,983 INFO L378 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 44 treesize of output 43 [2023-12-02 15:30:09,999 INFO L378 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 [2023-12-02 15:30:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:30:10,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:12,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9956 (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_9956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:30:12,261 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9955 (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~mem37#1.base| v_ArrVal_9955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:30:12,283 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9955 (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_9955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:30:12,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9955 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9954 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9954))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:30:12,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9955 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9954 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9954))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:30:12,887 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 15:30:12,888 INFO L378 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 109 treesize of output 108 [2023-12-02 15:30:12,907 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9955 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10002))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9954)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem34#1.base|)) is different from false [2023-12-02 15:30:12,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280037862] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:12,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:30:12,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 34 [2023-12-02 15:30:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009077976] [2023-12-02 15:30:12,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:30:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 15:30:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 15:30:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1160, Unknown=27, NotChecked=1780, Total=3192 [2023-12-02 15:30:12,914 INFO L87 Difference]: Start difference. First operand 700 states and 748 transitions. Second operand has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:30:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:25,823 INFO L93 Difference]: Finished difference Result 1300 states and 1394 transitions. [2023-12-02 15:30:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 15:30:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 15:30:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:25,829 INFO L225 Difference]: With dead ends: 1300 [2023-12-02 15:30:25,829 INFO L226 Difference]: Without dead ends: 1300 [2023-12-02 15:30:25,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=325, Invalid=2080, Unknown=27, NotChecked=2260, Total=4692 [2023-12-02 15:30:25,831 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 834 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 3875 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 3897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:25,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 2906 Invalid, 3897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3875 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-12-02 15:30:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-12-02 15:30:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 699. [2023-12-02 15:30:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 418 states have (on average 1.770334928229665) internal successors, (740), 693 states have internal predecessors, (740), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:30:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 747 transitions. [2023-12-02 15:30:25,845 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 747 transitions. Word has length 110 [2023-12-02 15:30:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:25,845 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 747 transitions. [2023-12-02 15:30:25,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:30:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 747 transitions. [2023-12-02 15:30:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 15:30:25,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:25,847 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] [2023-12-02 15:30:25,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-12-02 15:30:26,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 15:30:26,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 15:30:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:30:26,448 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:30:26,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1645640305, now seen corresponding path program 1 times [2023-12-02 15:30:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781497871] [2023-12-02 15:30:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:26,449 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 [2023-12-02 15:30:26,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:26,449 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:30:26,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:30:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:27,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 15:30:27,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:27,626 INFO L378 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 [2023-12-02 15:30:28,117 INFO L378 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 [2023-12-02 15:30:28,148 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:30:28,148 INFO L378 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 [2023-12-02 15:30:28,195 INFO L378 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 11 treesize of output 7 [2023-12-02 15:30:28,222 INFO L378 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 15 treesize of output 1 [2023-12-02 15:30:28,393 INFO L378 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 18 treesize of output 10 [2023-12-02 15:30:28,401 INFO L378 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 7 treesize of output 3 [2023-12-02 15:30:29,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:29,488 INFO L378 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 50 treesize of output 45 [2023-12-02 15:30:29,505 INFO L378 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 24 treesize of output 11 [2023-12-02 15:30:29,687 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:29,688 INFO L378 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 50 treesize of output 45 [2023-12-02 15:30:29,704 INFO L378 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 24 treesize of output 11 [2023-12-02 15:30:29,846 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:29,846 INFO L378 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 50 treesize of output 45 [2023-12-02 15:30:29,864 INFO L378 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 24 treesize of output 11 [2023-12-02 15:30:30,014 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:30,015 INFO L378 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 50 treesize of output 45 [2023-12-02 15:30:30,023 INFO L378 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 24 treesize of output 11 [2023-12-02 15:30:30,059 INFO L378 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 25 treesize of output 13 [2023-12-02 15:30:30,066 INFO L378 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 7 treesize of output 3 [2023-12-02 15:30:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:30:30,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:30,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:30:30,377 WARN L854 $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_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 15:30:30,476 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10488) .cse0 v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10488) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 15:30:30,576 WARN L854 $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_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10487))) (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_10488) .cse1 v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10488) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 15:30:53,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10582))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10486))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10581) .cse1 v_ArrVal_10485) .cse2 v_ArrVal_10488) (select (select (store .cse3 .cse2 v_ArrVal_10487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10489))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10582))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10486))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10487))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10581) .cse6 v_ArrVal_10485) .cse7 v_ArrVal_10488) .cse8 v_ArrVal_10489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 15:30:53,822 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781497871] [2023-12-02 15:30:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781497871] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699137169] [2023-12-02 15:30:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:53,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:30:53,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:30:53,823 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:30:53,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2023-12-02 15:31:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:52,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 121 conjunts are in the unsatisfiable core [2023-12-02 15:31:52,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:52,118 INFO L378 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 [2023-12-02 15:31:54,601 INFO L378 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 [2023-12-02 15:31:54,742 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:31:54,742 INFO L378 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 [2023-12-02 15:31:54,823 INFO L378 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 15 treesize of output 1 [2023-12-02 15:31:54,926 INFO L378 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 11 treesize of output 7 [2023-12-02 15:31:55,330 INFO L378 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 18 treesize of output 10 [2023-12-02 15:31:55,358 INFO L378 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 7 treesize of output 3 [2023-12-02 15:32:00,543 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:00,544 INFO L378 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 50 treesize of output 45 [2023-12-02 15:32:00,572 INFO L378 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 24 treesize of output 11 [2023-12-02 15:32:01,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:01,173 INFO L378 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 50 treesize of output 45 [2023-12-02 15:32:01,251 INFO L378 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 24 treesize of output 11 [2023-12-02 15:32:01,587 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:01,587 INFO L378 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 50 treesize of output 45 [2023-12-02 15:32:01,615 INFO L378 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 24 treesize of output 11 [2023-12-02 15:32:02,022 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:02,023 INFO L378 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 50 treesize of output 45 [2023-12-02 15:32:02,052 INFO L378 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 24 treesize of output 11 [2023-12-02 15:32:02,188 INFO L378 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 25 treesize of output 13 [2023-12-02 15:32:02,216 INFO L378 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 7 treesize of output 3 [2023-12-02 15:32:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:32:02,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:02,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 15:32:02,609 WARN L854 $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_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 15:32:02,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11067))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11068) .cse0 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11068) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2023-12-02 15:32:03,008 WARN L854 $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_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11068) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11067))) (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_11068) .cse3 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 15:32:04,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11065))) (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~mem36#1.base| v_ArrVal_11066) .cse1 v_ArrVal_11068) (select (select (store .cse2 .cse1 v_ArrVal_11067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11070))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11065))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11067))) (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~mem36#1.base| v_ArrVal_11066) .cse4 v_ArrVal_11068) .cse5 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:32:06,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11065))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11067))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11066) .cse1 v_ArrVal_11068) .cse2 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11065))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11066) .cse7 v_ArrVal_11068) (select (select (store .cse8 .cse7 v_ArrVal_11067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11070))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 15:32:11,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11162))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11065))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11067))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11161) .cse0 v_ArrVal_11066) .cse1 v_ArrVal_11068) .cse2 v_ArrVal_11070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11162))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11065))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11161) .cse8 v_ArrVal_11066) .cse9 v_ArrVal_11068) (select (select (store .cse10 .cse9 v_ArrVal_11067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11070))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 15:32:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1699137169] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624695297] [2023-12-02 15:32:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:11,290 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:11,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-12-02 15:32:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:12,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 15:32:12,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:13,768 INFO L378 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 [2023-12-02 15:32:13,909 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:32:13,909 INFO L378 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 [2023-12-02 15:32:14,373 INFO L378 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 19 treesize of output 1 [2023-12-02 15:32:14,428 INFO L378 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 [2023-12-02 15:32:15,645 INFO L378 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 [2023-12-02 15:32:15,674 INFO L378 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 [2023-12-02 15:32:20,788 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:32:20,788 INFO L378 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 62 treesize of output 57 [2023-12-02 15:32:20,818 INFO L378 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 30 treesize of output 13 [2023-12-02 15:32:22,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:32:22,081 INFO L378 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 62 treesize of output 57 [2023-12-02 15:32:22,136 INFO L378 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 30 treesize of output 13 [2023-12-02 15:32:22,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:32:22,888 INFO L378 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 62 treesize of output 57 [2023-12-02 15:32:22,970 INFO L378 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 30 treesize of output 13 [2023-12-02 15:32:23,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:32:23,734 INFO L378 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 62 treesize of output 57 [2023-12-02 15:32:23,818 INFO L378 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 30 treesize of output 13 [2023-12-02 15:32:23,902 INFO L378 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 [2023-12-02 15:32:23,956 INFO L378 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 [2023-12-02 15:32:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:32:23,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:24,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:32:24,344 WARN L854 $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_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:32:24,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11647))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11646) .cse0 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11646) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 15:32:24,883 WARN L854 $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_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11647))) (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_11646) .cse1 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11646) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 15:32:26,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11644))) (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~mem36#1.base| v_ArrVal_11645) .cse1 v_ArrVal_11646) (select (select (store .cse2 .cse1 v_ArrVal_11647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11648))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11644))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11647))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11645) .cse4 v_ArrVal_11646) .cse5 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:32:50,205 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11649 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11740))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11644))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11647))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11741) .cse0 v_ArrVal_11645) .cse1 v_ArrVal_11646) .cse2 v_ArrVal_11648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11649) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11740))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11644))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11741) .cse8 v_ArrVal_11645) .cse9 v_ArrVal_11646) (select (select (store .cse10 .cse9 v_ArrVal_11647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11648))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 15:32:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624695297] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:50,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 19 [2023-12-02 15:32:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142925340] [2023-12-02 15:32:50,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 15:32:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:32:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 15:32:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=486, Unknown=50, NotChecked=1134, Total=1806 [2023-12-02 15:32:50,243 INFO L87 Difference]: Start difference. First operand 699 states and 747 transitions. Second operand has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:34:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:22,996 INFO L93 Difference]: Finished difference Result 708 states and 757 transitions. [2023-12-02 15:34:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:34:22,997 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-12-02 15:34:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:23,001 INFO L225 Difference]: With dead ends: 708 [2023-12-02 15:34:23,001 INFO L226 Difference]: Without dead ends: 708 [2023-12-02 15:34:23,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 311 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=217, Invalid=850, Unknown=61, NotChecked=1422, Total=2550 [2023-12-02 15:34:23,002 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 347 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:23,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2344 Invalid, 4239 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 4229 Invalid, 0 Unknown, 0 Unchecked, 70.7s Time] [2023-12-02 15:34:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-12-02 15:34:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 698. [2023-12-02 15:34:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 418 states have (on average 1.7679425837320575) internal successors, (739), 692 states have internal predecessors, (739), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 15:34:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 746 transitions. [2023-12-02 15:34:23,011 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 746 transitions. Word has length 110 [2023-12-02 15:34:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:23,012 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 746 transitions. [2023-12-02 15:34:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:34:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 746 transitions. [2023-12-02 15:34:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 15:34:23,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:23,013 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] [2023-12-02 15:34:23,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2023-12-02 15:34:23,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:23,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:34:23,614 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-12-02 15:34:23,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 913330167, now seen corresponding path program 1 times [2023-12-02 15:34:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645765523] [2023-12-02 15:34:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:23,615 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 [2023-12-02 15:34:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:23,616 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 15:34:23,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/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 (46)] Waiting until timeout for monitored process [2023-12-02 15:34:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:25,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 15:34:25,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:25,602 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 15:34:25,602 INFO L378 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 22 [2023-12-02 15:34:30,621 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:34:30,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-12-02 15:34:31,131 INFO L378 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 19 treesize of output 1 [2023-12-02 15:34:32,654 INFO L378 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 42 treesize of output 24 [2023-12-02 15:34:51,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:34:51,899 INFO L378 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 62 treesize of output 59 [2023-12-02 15:34:53,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:34:53,341 INFO L378 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 62 treesize of output 59 [2023-12-02 15:34:54,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:34:54,413 INFO L378 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 62 treesize of output 59 [2023-12-02 15:34:55,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:34:55,561 INFO L378 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 62 treesize of output 59 [2023-12-02 15:34:56,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:34:56,746 INFO L378 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 62 treesize of output 59 [2023-12-02 15:34:56,984 INFO L378 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 51 treesize of output 27 [2023-12-02 15:34:57,995 INFO L349 Elim1Store]: treesize reduction 44, result has 51.1 percent of original size [2023-12-02 15:34:57,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 73 [2023-12-02 15:34:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:34:59,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:00,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12198) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-12-02 15:35:00,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 15:35:00,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:35:00,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:35:01,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12196 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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~mem37#1.base| v_ArrVal_12196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:35:01,174 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12196 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:35:01,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12196 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12195))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:35:03,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12196 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_12245))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12195)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:35:03,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645765523] [2023-12-02 15:35:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645765523] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:35:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470364035] [2023-12-02 15:35:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:03,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:03,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:03,930 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:03,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-12-02 15:35:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:24,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 15:35:24,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:25,102 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:35:25,103 INFO L378 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 14 treesize of output 20 [2023-12-02 15:35:30,587 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:35:30,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 15:35:31,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:35:33,496 INFO L378 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 28 treesize of output 16 [2023-12-02 15:35:47,135 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:35:47,135 INFO L378 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 44 treesize of output 41 [2023-12-02 15:35:49,198 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:35:49,199 INFO L378 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 44 treesize of output 41 [2023-12-02 15:35:50,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:35:50,536 INFO L378 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 44 treesize of output 41 [2023-12-02 15:35:51,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:35:51,824 INFO L378 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 44 treesize of output 41 [2023-12-02 15:35:53,254 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:35:53,255 INFO L378 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 44 treesize of output 41 [2023-12-02 15:35:53,417 INFO L378 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 35 treesize of output 19 [2023-12-02 15:35:54,279 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2023-12-02 15:35:54,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2023-12-02 15:35:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:35:55,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:55,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12703) |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 [2023-12-02 15:35:56,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:35:56,106 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12702))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:35:56,192 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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_12702))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:35:56,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (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~mem37#1.base| v_ArrVal_12701))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12702)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:35:56,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12701))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12702)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:35:56,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12700))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12701)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12702)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:35:56,566 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12702 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12700))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12701)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12702)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12703)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:35:59,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470364035] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:35:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36558798] [2023-12-02 15:35:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:59,452 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:59,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c9acbd-2758-4163-b248-434a3b5b2cea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-12-02 15:36:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:00,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 15:36:00,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:02,806 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:36:02,806 INFO L378 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 [2023-12-02 15:36:03,529 INFO L378 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 19 treesize of output 1 [2023-12-02 15:36:10,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:36:10,946 INFO L378 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 44 treesize of output 43 [2023-12-02 15:36:12,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:36:12,807 INFO L378 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 44 treesize of output 43 [2023-12-02 15:36:13,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:36:13,912 INFO L378 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 44 treesize of output 43