./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/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 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:28:54,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:28:54,486 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 14:28:54,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:28:54,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:28:54,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:28:54,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:28:54,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:28:54,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:28:54,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:28:54,522 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:28:54,522 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:28:54,523 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:28:54,523 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:28:54,524 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:28:54,524 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:28:54,525 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:28:54,526 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:28:54,526 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:28:54,527 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:28:54,527 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:28:54,528 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:28:54,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:28:54,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:28:54,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:28:54,530 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:28:54,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:28:54,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:28:54,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:28:54,532 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:28:54,532 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:28:54,533 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:28:54,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:28:54,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:28:54,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:28:54,534 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:28:54,534 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:28:54,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:28:54,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:28:54,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:28:54,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:28:54,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:28:54,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:28:54,536 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:28:54,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:28:54,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:28:54,537 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:28:54,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:28:54,537 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_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/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 -> 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f [2023-12-02 14:28:54,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:28:54,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:28:54,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:28:54,791 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:28:54,792 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:28:54,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2023-12-02 14:28:57,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:28:57,877 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:28:57,877 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2023-12-02 14:28:57,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/99f8425cd/7926a9b2081a4da2a80c6a6b4eb98bc4/FLAGb0f35d82d [2023-12-02 14:28:57,910 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/99f8425cd/7926a9b2081a4da2a80c6a6b4eb98bc4 [2023-12-02 14:28:57,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:28:57,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:28:57,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:28:57,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:28:57,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:28:57,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:28:57" (1/1) ... [2023-12-02 14:28:57,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee8abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:57, skipping insertion in model container [2023-12-02 14:28:57,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:28:57" (1/1) ... [2023-12-02 14:28:58,001 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:28:58,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:28:58,583 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 14:28:58,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@284de489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:58, skipping insertion in model container [2023-12-02 14:28:58,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:28:58,585 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 14:28:58,587 INFO L158 Benchmark]: Toolchain (without parser) took 672.67ms. Allocated memory is still 148.9MB. Free memory was 86.9MB in the beginning and 101.8MB in the end (delta: -14.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-12-02 14:28:58,588 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:28:58,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.92ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 101.8MB in the end (delta: -15.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-12-02 14:28:58,591 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.19ms. Allocated memory is still 94.4MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.92ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 101.8MB in the end (delta: -15.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/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 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:29:00,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:29:00,611 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 14:29:00,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:29:00,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:29:00,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:29:00,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:29:00,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:29:00,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:29:00,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:29:00,650 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:29:00,650 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:29:00,651 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:29:00,651 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:29:00,652 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:29:00,652 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:29:00,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:29:00,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:29:00,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:29:00,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:29:00,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:29:00,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:29:00,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:29:00,657 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:29:00,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:29:00,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:29:00,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:29:00,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:29:00,659 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:29:00,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:29:00,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:29:00,661 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:29:00,661 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:29:00,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:29:00,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:29:00,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:29:00,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:29:00,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:29:00,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:29:00,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:29:00,663 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:29:00,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:29:00,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:29:00,663 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:29:00,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:29:00,664 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_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/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 -> 9a08b66a27502bd32ab373960778294a6ce88841aa5560ae4bca712e152c143f [2023-12-02 14:29:00,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:29:00,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:29:00,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:29:00,965 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:29:00,965 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:29:00,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2023-12-02 14:29:03,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:29:04,129 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:29:04,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-2.i [2023-12-02 14:29:04,149 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/2c2dd307c/c0fb24e700214df091522262a8e93f45/FLAG6fdc06c09 [2023-12-02 14:29:04,165 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/data/2c2dd307c/c0fb24e700214df091522262a8e93f45 [2023-12-02 14:29:04,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:29:04,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:29:04,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:29:04,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:29:04,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:29:04,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:29:04" (1/1) ... [2023-12-02 14:29:04,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162f0242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:04, skipping insertion in model container [2023-12-02 14:29:04,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:29:04" (1/1) ... [2023-12-02 14:29:04,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:29:04,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:29:04,827 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 14:29:04,842 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:29:04,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:29:04,989 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:29:05,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:29:05,125 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:29:05,133 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:29:05,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05 WrapperNode [2023-12-02 14:29:05,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:29:05,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:29:05,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:29:05,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:29:05,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,259 INFO L138 Inliner]: procedures = 180, calls = 441, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2023-12-02 14:29:05,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:29:05,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:29:05,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:29:05,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:29:05,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:29:05,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:29:05,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:29:05,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:29:05,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (1/1) ... [2023-12-02 14:29:05,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:29:05,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:05,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:29:05,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:29:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 14:29:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 14:29:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 14:29:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 14:29:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 14:29:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 14:29:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 14:29:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 14:29:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:29:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:29:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:29:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:29:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 14:29:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:29:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:29:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 14:29:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:29:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:29:05,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:29:05,727 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:29:05,730 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:29:05,753 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 14:29:12,846 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:29:13,110 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:29:13,110 INFO L309 CfgBuilder]: Removed 92 assume(true) statements. [2023-12-02 14:29:13,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:29:13 BoogieIcfgContainer [2023-12-02 14:29:13,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:29:13,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:29:13,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:29:13,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:29:13,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:29:04" (1/3) ... [2023-12-02 14:29:13,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab176e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:29:13, skipping insertion in model container [2023-12-02 14:29:13,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:05" (2/3) ... [2023-12-02 14:29:13,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab176e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:29:13, skipping insertion in model container [2023-12-02 14:29:13,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:29:13" (3/3) ... [2023-12-02 14:29:13,123 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-2.i [2023-12-02 14:29:13,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:29:13,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 833 error locations. [2023-12-02 14:29:13,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:29:13,240 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;@7df103ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:29:13,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 833 error locations. [2023-12-02 14:29:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 1507 states, 663 states have (on average 2.5279034690799396) internal successors, (1676), 1497 states have internal predecessors, (1676), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:29:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 14:29:13,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:13,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 14:29:13,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:13,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 78318715, now seen corresponding path program 1 times [2023-12-02 14:29:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479204985] [2023-12-02 14:29:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:13,272 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 14:29:13,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:13,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:13,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:13,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:29:13,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:13,537 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 14:29:13,553 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 14:29:13,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:13,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479204985] [2023-12-02 14:29:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479204985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:13,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:29:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815503256] [2023-12-02 14:29:13,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:13,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:13,604 INFO L87 Difference]: Start difference. First operand has 1507 states, 663 states have (on average 2.5279034690799396) internal successors, (1676), 1497 states have internal predecessors, (1676), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) 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 14:29:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:17,134 INFO L93 Difference]: Finished difference Result 1716 states and 1853 transitions. [2023-12-02 14:29:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:17,136 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 14:29:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:17,154 INFO L225 Difference]: With dead ends: 1716 [2023-12-02 14:29:17,154 INFO L226 Difference]: Without dead ends: 1715 [2023-12-02 14:29:17,155 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 14:29:17,158 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 1235 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:17,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1280 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 14:29:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-12-02 14:29:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1461. [2023-12-02 14:29:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 720 states have (on average 2.2069444444444444) internal successors, (1589), 1451 states have internal predecessors, (1589), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1613 transitions. [2023-12-02 14:29:17,243 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1613 transitions. Word has length 4 [2023-12-02 14:29:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1613 transitions. [2023-12-02 14:29:17,244 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 14:29:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1613 transitions. [2023-12-02 14:29:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 14:29:17,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:17,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 14:29:17,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:17,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:17,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:17,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 78318716, now seen corresponding path program 1 times [2023-12-02 14:29:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842536245] [2023-12-02 14:29:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:17,447 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 14:29:17,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:17,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:17,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:17,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:29:17,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:17,577 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 14:29:17,598 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 14:29:17,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:17,598 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:17,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842536245] [2023-12-02 14:29:17,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842536245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:17,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:29:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135616648] [2023-12-02 14:29:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:17,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:17,603 INFO L87 Difference]: Start difference. First operand 1461 states and 1613 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 14:29:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:22,413 INFO L93 Difference]: Finished difference Result 1930 states and 2133 transitions. [2023-12-02 14:29:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:22,413 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 14:29:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:22,426 INFO L225 Difference]: With dead ends: 1930 [2023-12-02 14:29:22,427 INFO L226 Difference]: Without dead ends: 1930 [2023-12-02 14:29:22,427 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 14:29:22,429 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 673 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:22,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1862 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-02 14:29:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2023-12-02 14:29:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1584. [2023-12-02 14:29:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 853 states have (on average 2.182883939038687) internal successors, (1862), 1574 states have internal predecessors, (1862), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1886 transitions. [2023-12-02 14:29:22,486 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1886 transitions. Word has length 4 [2023-12-02 14:29:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:22,486 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1886 transitions. [2023-12-02 14:29:22,487 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 14:29:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1886 transitions. [2023-12-02 14:29:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 14:29:22,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:22,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 14:29:22,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:22,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:22,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:22,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1865395856, now seen corresponding path program 1 times [2023-12-02 14:29:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633329422] [2023-12-02 14:29:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:22,691 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 14:29:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:22,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:22,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:22,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:29:22,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:22,838 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 14:29:22,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:22,839 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633329422] [2023-12-02 14:29:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633329422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:29:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812816707] [2023-12-02 14:29:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:22,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:22,842 INFO L87 Difference]: Start difference. First operand 1584 states and 1886 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 14:29:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:25,025 INFO L93 Difference]: Finished difference Result 2969 states and 3562 transitions. [2023-12-02 14:29:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:25,027 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 14:29:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:25,043 INFO L225 Difference]: With dead ends: 2969 [2023-12-02 14:29:25,043 INFO L226 Difference]: Without dead ends: 2969 [2023-12-02 14:29:25,044 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 14:29:25,045 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 1243 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:25,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2841 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 14:29:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2023-12-02 14:29:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1586. [2023-12-02 14:29:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 855 states have (on average 2.1801169590643275) internal successors, (1864), 1576 states have internal predecessors, (1864), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1888 transitions. [2023-12-02 14:29:25,101 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1888 transitions. Word has length 5 [2023-12-02 14:29:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:25,101 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 1888 transitions. [2023-12-02 14:29:25,101 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 14:29:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1888 transitions. [2023-12-02 14:29:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 14:29:25,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:25,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:29:25,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:25,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:25,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:25,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash -599452795, now seen corresponding path program 1 times [2023-12-02 14:29:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86151620] [2023-12-02 14:29:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:29:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:25,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:25,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:25,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:29:25,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:25,493 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 14:29:25,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:25,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86151620] [2023-12-02 14:29:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86151620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:29:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489889887] [2023-12-02 14:29:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:25,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:25,496 INFO L87 Difference]: Start difference. First operand 1586 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:26,794 INFO L93 Difference]: Finished difference Result 1547 states and 1848 transitions. [2023-12-02 14:29:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 14:29:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:26,804 INFO L225 Difference]: With dead ends: 1547 [2023-12-02 14:29:26,804 INFO L226 Difference]: Without dead ends: 1547 [2023-12-02 14:29:26,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 14:29:26,805 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 70 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:26,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2487 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 14:29:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2023-12-02 14:29:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2023-12-02 14:29:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 840 states have (on average 2.1714285714285713) internal successors, (1824), 1537 states have internal predecessors, (1824), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1848 transitions. [2023-12-02 14:29:26,845 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1848 transitions. Word has length 10 [2023-12-02 14:29:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:26,845 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 1848 transitions. [2023-12-02 14:29:26,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1848 transitions. [2023-12-02 14:29:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 14:29:26,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:26,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:29:26,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Ended with exit code 0 [2023-12-02 14:29:27,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:27,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:27,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash -548522209, now seen corresponding path program 1 times [2023-12-02 14:29:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71262434] [2023-12-02 14:29:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:27,048 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 14:29:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:27,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:27,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:27,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:29:27,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:27,205 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 14:29:27,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:27,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71262434] [2023-12-02 14:29:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71262434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:29:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230619132] [2023-12-02 14:29:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:27,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:27,208 INFO L87 Difference]: Start difference. First operand 1547 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14:29:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:28,920 INFO L93 Difference]: Finished difference Result 1533 states and 1827 transitions. [2023-12-02 14:29:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-02 14:29:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:28,929 INFO L225 Difference]: With dead ends: 1533 [2023-12-02 14:29:28,930 INFO L226 Difference]: Without dead ends: 1533 [2023-12-02 14:29:28,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 14:29:28,930 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 58 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:28,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3687 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 14:29:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-12-02 14:29:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1532. [2023-12-02 14:29:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 839 states have (on average 2.1477949940405243) internal successors, (1802), 1522 states have internal predecessors, (1802), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1826 transitions. [2023-12-02 14:29:28,956 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1826 transitions. Word has length 12 [2023-12-02 14:29:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:28,956 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1826 transitions. [2023-12-02 14:29:28,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14:29:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1826 transitions. [2023-12-02 14:29:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:29:28,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:28,957 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] [2023-12-02 14:29:28,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Ended with exit code 0 [2023-12-02 14:29:29,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:29,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:29,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1536799155, now seen corresponding path program 1 times [2023-12-02 14:29:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:29,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736059846] [2023-12-02 14:29:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:29,159 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 14:29:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:29,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:29,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:29,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:29:29,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:29,328 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 14:29:29,411 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 14:29:29,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:29,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736059846] [2023-12-02 14:29:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736059846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:29,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:29,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:29:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658809743] [2023-12-02 14:29:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:29,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:29,416 INFO L87 Difference]: Start difference. First operand 1532 states and 1826 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 14:29:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:33,751 INFO L93 Difference]: Finished difference Result 1783 states and 2062 transitions. [2023-12-02 14:29:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:33,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-12-02 14:29:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:33,758 INFO L225 Difference]: With dead ends: 1783 [2023-12-02 14:29:33,758 INFO L226 Difference]: Without dead ends: 1783 [2023-12-02 14:29:33,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 14:29:33,759 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 1170 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:33,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1604 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 14:29:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2023-12-02 14:29:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1528. [2023-12-02 14:29:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 839 states have (on average 2.143027413587604) internal successors, (1798), 1518 states have internal predecessors, (1798), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1822 transitions. [2023-12-02 14:29:33,791 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1822 transitions. Word has length 26 [2023-12-02 14:29:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:33,792 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 1822 transitions. [2023-12-02 14:29:33,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 14:29:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1822 transitions. [2023-12-02 14:29:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:29:33,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:33,793 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] [2023-12-02 14:29:33,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:33,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:33,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:33,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1536799154, now seen corresponding path program 1 times [2023-12-02 14:29:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454690417] [2023-12-02 14:29:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:33,996 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 14:29:33,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:33,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:33,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:34,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:29:34,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:34,186 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 14:29:34,383 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 14:29:34,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:34,383 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454690417] [2023-12-02 14:29:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454690417] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:34,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:34,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:29:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489078297] [2023-12-02 14:29:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:34,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:34,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:34,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:34,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:34,386 INFO L87 Difference]: Start difference. First operand 1528 states and 1822 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 14:29:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:40,645 INFO L93 Difference]: Finished difference Result 1871 states and 2066 transitions. [2023-12-02 14:29:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-12-02 14:29:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:40,652 INFO L225 Difference]: With dead ends: 1871 [2023-12-02 14:29:40,652 INFO L226 Difference]: Without dead ends: 1871 [2023-12-02 14:29:40,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 14:29:40,653 INFO L413 NwaCegarLoop]: 1043 mSDtfsCounter, 610 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:40,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2215 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-02 14:29:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-12-02 14:29:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1524. [2023-12-02 14:29:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 839 states have (on average 2.138259833134684) internal successors, (1794), 1514 states have internal predecessors, (1794), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1818 transitions. [2023-12-02 14:29:40,688 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1818 transitions. Word has length 26 [2023-12-02 14:29:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:40,688 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1818 transitions. [2023-12-02 14:29:40,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 14:29:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1818 transitions. [2023-12-02 14:29:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 14:29:40,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:40,690 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] [2023-12-02 14:29:40,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:40,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:40,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1967919559, now seen corresponding path program 1 times [2023-12-02 14:29:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480540394] [2023-12-02 14:29:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:40,896 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 14:29:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:40,898 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:40,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:41,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:29:41,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:41,143 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 14:29:41,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:41,143 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:41,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480540394] [2023-12-02 14:29:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480540394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:41,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:29:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388898594] [2023-12-02 14:29:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:41,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:41,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:41,145 INFO L87 Difference]: Start difference. First operand 1524 states and 1818 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:42,735 INFO L93 Difference]: Finished difference Result 1518 states and 1808 transitions. [2023-12-02 14:29:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-02 14:29:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:42,742 INFO L225 Difference]: With dead ends: 1518 [2023-12-02 14:29:42,742 INFO L226 Difference]: Without dead ends: 1518 [2023-12-02 14:29:42,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:29:42,743 INFO L413 NwaCegarLoop]: 1231 mSDtfsCounter, 23 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:42,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3673 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 14:29:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2023-12-02 14:29:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2023-12-02 14:29:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 833 states have (on average 2.141656662665066) internal successors, (1784), 1508 states have internal predecessors, (1784), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1808 transitions. [2023-12-02 14:29:42,763 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1808 transitions. Word has length 42 [2023-12-02 14:29:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:42,763 INFO L495 AbstractCegarLoop]: Abstraction has 1518 states and 1808 transitions. [2023-12-02 14:29:42,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1808 transitions. [2023-12-02 14:29:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 14:29:42,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:42,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:42,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:42,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:42,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:42,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash 90413223, now seen corresponding path program 1 times [2023-12-02 14:29:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510360254] [2023-12-02 14:29:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:42,967 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 14:29:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:42,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:42,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:43,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:29:43,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:43,462 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 14:29:43,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:43,463 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510360254] [2023-12-02 14:29:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510360254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:29:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589866562] [2023-12-02 14:29:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:43,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:43,466 INFO L87 Difference]: Start difference. First operand 1518 states and 1808 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 14:29:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:45,049 INFO L93 Difference]: Finished difference Result 1741 states and 2040 transitions. [2023-12-02 14:29:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2023-12-02 14:29:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:45,058 INFO L225 Difference]: With dead ends: 1741 [2023-12-02 14:29:45,058 INFO L226 Difference]: Without dead ends: 1741 [2023-12-02 14:29:45,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 14:29:45,059 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 246 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:45,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2430 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 14:29:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2023-12-02 14:29:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1561. [2023-12-02 14:29:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 876 states have (on average 2.085616438356164) internal successors, (1827), 1551 states have internal predecessors, (1827), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1851 transitions. [2023-12-02 14:29:45,090 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1851 transitions. Word has length 46 [2023-12-02 14:29:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:45,091 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1851 transitions. [2023-12-02 14:29:45,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 14:29:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1851 transitions. [2023-12-02 14:29:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 14:29:45,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:45,093 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] [2023-12-02 14:29:45,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:45,299 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:45,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash 448358968, now seen corresponding path program 1 times [2023-12-02 14:29:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826230428] [2023-12-02 14:29:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:45,300 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 14:29:45,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:45,301 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:45,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:45,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:29:45,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:45,657 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 14:29:45,666 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 14:29:46,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:29:46,158 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 14:29:46,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:29:46,177 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 14:29:46,215 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 14:29:46,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:46,216 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826230428] [2023-12-02 14:29:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826230428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:29:46,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584631880] [2023-12-02 14:29:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:46,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:46,219 INFO L87 Difference]: Start difference. First operand 1561 states and 1851 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:50,856 INFO L93 Difference]: Finished difference Result 1731 states and 2006 transitions. [2023-12-02 14:29:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-02 14:29:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:50,866 INFO L225 Difference]: With dead ends: 1731 [2023-12-02 14:29:50,866 INFO L226 Difference]: Without dead ends: 1731 [2023-12-02 14:29:50,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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 14:29:50,867 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 1377 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:50,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 761 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 14:29:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2023-12-02 14:29:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1344. [2023-12-02 14:29:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 743 states have (on average 1.9636608344549125) internal successors, (1459), 1334 states have internal predecessors, (1459), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1483 transitions. [2023-12-02 14:29:50,887 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1483 transitions. Word has length 49 [2023-12-02 14:29:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:50,887 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1483 transitions. [2023-12-02 14:29:50,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1483 transitions. [2023-12-02 14:29:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 14:29:50,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:50,889 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] [2023-12-02 14:29:50,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Ended with exit code 0 [2023-12-02 14:29:51,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:51,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:51,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1879045536, now seen corresponding path program 1 times [2023-12-02 14:29:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603000095] [2023-12-02 14:29:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:51,091 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 14:29:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:51,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:51,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:51,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:29:51,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:51,346 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 14:29:51,364 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 14:29:51,389 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 14:29:51,400 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 14:29:51,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:51,400 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603000095] [2023-12-02 14:29:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603000095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:51,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:29:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719628355] [2023-12-02 14:29:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:29:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:29:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:29:51,403 INFO L87 Difference]: Start difference. First operand 1344 states and 1483 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:55,711 INFO L93 Difference]: Finished difference Result 1343 states and 1482 transitions. [2023-12-02 14:29:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:29:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 14:29:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:55,720 INFO L225 Difference]: With dead ends: 1343 [2023-12-02 14:29:55,720 INFO L226 Difference]: Without dead ends: 1343 [2023-12-02 14:29:55,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 14:29:55,721 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 3 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3006 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3006 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 14:29:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2023-12-02 14:29:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2023-12-02 14:29:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 743 states have (on average 1.9623149394347241) internal successors, (1458), 1333 states have internal predecessors, (1458), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:29:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1482 transitions. [2023-12-02 14:29:55,738 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1482 transitions. Word has length 53 [2023-12-02 14:29:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:55,738 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1482 transitions. [2023-12-02 14:29:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:29:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1482 transitions. [2023-12-02 14:29:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 14:29:55,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:55,740 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] [2023-12-02 14:29:55,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:55,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:29:55,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1879045537, now seen corresponding path program 1 times [2023-12-02 14:29:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:29:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755355281] [2023-12-02 14:29:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:55,941 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 14:29:55,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:29:55,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:55,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:29:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:56,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 14:29:56,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:56,188 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 14:29:56,210 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 14:29:56,218 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 14:29:56,260 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 14:29:56,283 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 14:29:56,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:56,283 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:29:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755355281] [2023-12-02 14:29:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755355281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:29:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647485738] [2023-12-02 14:29:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:56,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:29:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:29:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:29:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:29:56,285 INFO L87 Difference]: Start difference. First operand 1343 states and 1482 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:30:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:02,347 INFO L93 Difference]: Finished difference Result 1342 states and 1481 transitions. [2023-12-02 14:30:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:30:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 14:30:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:02,353 INFO L225 Difference]: With dead ends: 1342 [2023-12-02 14:30:02,353 INFO L226 Difference]: Without dead ends: 1342 [2023-12-02 14:30:02,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 14:30:02,354 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:02,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3050 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-02 14:30:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-12-02 14:30:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2023-12-02 14:30:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 742 states have (on average 1.963611859838275) internal successors, (1457), 1332 states have internal predecessors, (1457), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 14:30:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1481 transitions. [2023-12-02 14:30:02,369 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1481 transitions. Word has length 53 [2023-12-02 14:30:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:02,369 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1481 transitions. [2023-12-02 14:30:02,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:30:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1481 transitions. [2023-12-02 14:30:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 14:30:02,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:02,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:30:02,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:02,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:30:02,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash 440017318, now seen corresponding path program 1 times [2023-12-02 14:30:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935003954] [2023-12-02 14:30:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:02,572 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 14:30:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:02,573 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:02,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:02,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:30:02,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:02,873 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 14:30:02,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:30:02,873 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935003954] [2023-12-02 14:30:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935003954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:30:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:30:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:30:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692592747] [2023-12-02 14:30:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:30:02,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:30:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:30:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:30:02,876 INFO L87 Difference]: Start difference. First operand 1342 states and 1481 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 14:30:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:04,349 INFO L93 Difference]: Finished difference Result 1344 states and 1485 transitions. [2023-12-02 14:30:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:30:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2023-12-02 14:30:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:04,357 INFO L225 Difference]: With dead ends: 1344 [2023-12-02 14:30:04,357 INFO L226 Difference]: Without dead ends: 1344 [2023-12-02 14:30:04,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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 14:30:04,358 INFO L413 NwaCegarLoop]: 1158 mSDtfsCounter, 1 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:04,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3468 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 14:30:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2023-12-02 14:30:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2023-12-02 14:30:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 743 states have (on average 1.9636608344549125) internal successors, (1459), 1334 states have internal predecessors, (1459), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:30:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1485 transitions. [2023-12-02 14:30:04,377 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1485 transitions. Word has length 59 [2023-12-02 14:30:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:04,377 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1485 transitions. [2023-12-02 14:30:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 14:30:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1485 transitions. [2023-12-02 14:30:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 14:30:04,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:04,378 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 14:30:04,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:04,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:30:04,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -58990864, now seen corresponding path program 1 times [2023-12-02 14:30:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596320575] [2023-12-02 14:30:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:04,580 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 14:30:04,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:04,581 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:04,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:04,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:30:04,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:04,843 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 14:30:04,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:04,916 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 14:30:04,916 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596320575] [2023-12-02 14:30:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596320575] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929561145] [2023-12-02 14:30:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:04,917 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:30:04,918 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:30:04,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-02 14:30:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:05,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:30:05,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:05,380 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 14:30:05,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:05,406 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 14:30:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929561145] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346931954] [2023-12-02 14:30:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:30:05,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:30:05,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 14:30:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:05,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:30:05,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:05,674 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 14:30:05,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:05,702 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 14:30:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346931954] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:05,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:30:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 14:30:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276457288] [2023-12-02 14:30:05,703 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:30:05,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:30:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:30:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:30:05,705 INFO L87 Difference]: Start difference. First operand 1344 states and 1485 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 14:30:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:07,335 INFO L93 Difference]: Finished difference Result 1353 states and 1500 transitions. [2023-12-02 14:30:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:30:07,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-12-02 14:30:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:07,343 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 14:30:07,343 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 14:30:07,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 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 14:30:07,344 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 7 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3464 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:07,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3464 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 14:30:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 14:30:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1352. [2023-12-02 14:30:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 750 states have (on average 1.9626666666666666) internal successors, (1472), 1341 states have internal predecessors, (1472), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:30:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1498 transitions. [2023-12-02 14:30:07,366 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1498 transitions. Word has length 60 [2023-12-02 14:30:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:07,366 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1498 transitions. [2023-12-02 14:30:07,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 14:30:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1498 transitions. [2023-12-02 14:30:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 14:30:07,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:07,368 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] [2023-12-02 14:30:07,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-12-02 14:30:07,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:07,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 14:30:07,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:07,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:30:07,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2070160422, now seen corresponding path program 2 times [2023-12-02 14:30:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068044938] [2023-12-02 14:30:07,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:30:07,970 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 14:30:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:07,970 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:07,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (18)] Waiting until timeout for monitored process [2023-12-02 14:30:08,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:30:08,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:30:08,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:30:08,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:08,493 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 14:30:08,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:08,662 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 14:30:08,662 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068044938] [2023-12-02 14:30:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068044938] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1039511673] [2023-12-02 14:30:08,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:30:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:30:08,673 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:30:08,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 14:30:09,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:30:09,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:30:09,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:30:09,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:09,994 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 14:30:09,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:10,044 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 14:30:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1039511673] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791751609] [2023-12-02 14:30:10,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:30:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:30:10,046 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:30:10,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 14:30:23,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:30:23,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:30:23,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:30:23,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:23,258 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:30:23,259 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 14:30:23,296 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 14:30:23,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:30:23,589 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 14:30:23,669 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 14:30:23,707 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 14:30:23,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:23,835 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:30:23,835 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 14:30:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791751609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:30:23,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:30:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 14:30:23,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617721909] [2023-12-02 14:30:23,961 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:30:23,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 14:30:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 14:30:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=551, Unknown=8, NotChecked=0, Total=650 [2023-12-02 14:30:23,964 INFO L87 Difference]: Start difference. First operand 1352 states and 1498 transitions. Second operand has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 14:30:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:41,782 INFO L93 Difference]: Finished difference Result 1620 states and 1763 transitions. [2023-12-02 14:30:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 14:30:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 63 [2023-12-02 14:30:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:41,789 INFO L225 Difference]: With dead ends: 1620 [2023-12-02 14:30:41,789 INFO L226 Difference]: Without dead ends: 1618 [2023-12-02 14:30:41,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=458, Invalid=2501, Unknown=11, NotChecked=0, Total=2970 [2023-12-02 14:30:41,790 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1077 mSDsluCounter, 8810 mSDsCounter, 0 mSdLazyCounter, 9749 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 9505 SdHoareTripleChecker+Invalid, 9818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 9749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:41,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 9505 Invalid, 9818 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 9749 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2023-12-02 14:30:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2023-12-02 14:30:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1360. [2023-12-02 14:30:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 759 states have (on average 1.9538866930171277) internal successors, (1483), 1349 states have internal predecessors, (1483), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:30:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1509 transitions. [2023-12-02 14:30:41,815 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1509 transitions. Word has length 63 [2023-12-02 14:30:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:41,815 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1509 transitions. [2023-12-02 14:30:41,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 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 14:30:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1509 transitions. [2023-12-02 14:30:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 14:30:41,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:41,817 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] [2023-12-02 14:30:41,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 14:30:42,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-02 14:30:42,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (18)] Ended with exit code 0 [2023-12-02 14:30:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:42,418 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:30:42,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1167896601, now seen corresponding path program 1 times [2023-12-02 14:30:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:42,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444402886] [2023-12-02 14:30:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:42,419 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 14:30:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:42,420 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:42,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (21)] Waiting until timeout for monitored process [2023-12-02 14:30:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:42,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 14:30:42,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:42,869 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 14:30:42,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:43,394 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 14:30:43,394 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444402886] [2023-12-02 14:30:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444402886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717480392] [2023-12-02 14:30:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:43,395 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:30:43,396 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:30:43,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 14:30:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:43,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 14:30:43,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:43,971 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 14:30:43,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:44,088 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 14:30:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1717480392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778146140] [2023-12-02 14:30:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:30:44,090 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:30:44,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 14:30:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:44,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 14:30:44,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:44,518 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 14:30:44,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:45,247 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 14:30:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778146140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:45,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:30:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 14:30:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266456950] [2023-12-02 14:30:45,247 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:30:45,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 14:30:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 14:30:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 14:30:45,250 INFO L87 Difference]: Start difference. First operand 1360 states and 1509 transitions. Second operand has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:30:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:54,608 INFO L93 Difference]: Finished difference Result 1390 states and 1563 transitions. [2023-12-02 14:30:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 14:30:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2023-12-02 14:30:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:54,614 INFO L225 Difference]: With dead ends: 1390 [2023-12-02 14:30:54,614 INFO L226 Difference]: Without dead ends: 1387 [2023-12-02 14:30:54,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 14:30:54,616 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 25 mSDsluCounter, 14959 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16112 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:54,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16112 Invalid, 3088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-02 14:30:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2023-12-02 14:30:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1378. [2023-12-02 14:30:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 777 states have (on average 1.9382239382239381) internal successors, (1506), 1367 states have internal predecessors, (1506), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:30:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1532 transitions. [2023-12-02 14:30:54,645 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1532 transitions. Word has length 69 [2023-12-02 14:30:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:54,645 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1532 transitions. [2023-12-02 14:30:54,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:30:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1532 transitions. [2023-12-02 14:30:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 14:30:54,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:54,647 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] [2023-12-02 14:30:54,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 14:30:54,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (21)] Ended with exit code 0 [2023-12-02 14:30:55,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-02 14:30:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:55,248 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:30:55,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1939748711, now seen corresponding path program 2 times [2023-12-02 14:30:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465811437] [2023-12-02 14:30:55,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:30:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:30:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:55,250 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:30:55,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Waiting until timeout for monitored process [2023-12-02 14:30:55,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:30:55,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:30:55,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 14:30:55,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:56,352 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 14:30:56,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:58,853 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 14:30:58,854 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465811437] [2023-12-02 14:30:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465811437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:30:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366355160] [2023-12-02 14:30:58,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:30:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:30:58,855 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:30:58,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 14:31:00,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:31:00,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:31:00,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 14:31:00,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:31:00,293 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 14:31:00,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:31:00,847 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 14:31:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1366355160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:31:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820285215] [2023-12-02 14:31:00,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:31:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:31:00,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:31:00,849 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:31:00,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 14:31:17,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:31:17,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:31:17,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 14:31:17,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:31:18,166 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 14:31:18,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:31:18,178 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 14:31:18,284 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 14:31:18,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 14:31:18,657 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 14:31:18,663 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 14:31:19,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:31:19,237 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 14:31:19,247 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 14:31:19,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 31 treesize of output 13 [2023-12-02 14:31:19,431 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 14:31:19,551 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 14:31:19,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:31:20,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:31:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820285215] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:31:20,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:31:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 14:31:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711277572] [2023-12-02 14:31:20,512 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:31:20,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 14:31:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:31:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 14:31:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 14:31:20,515 INFO L87 Difference]: Start difference. First operand 1378 states and 1532 transitions. Second operand has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 14:32:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:32:27,201 INFO L93 Difference]: Finished difference Result 1745 states and 1982 transitions. [2023-12-02 14:32:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 14:32:27,202 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 81 [2023-12-02 14:32:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:32:27,207 INFO L225 Difference]: With dead ends: 1745 [2023-12-02 14:32:27,207 INFO L226 Difference]: Without dead ends: 1736 [2023-12-02 14:32:27,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7047 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 14:32:27,215 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 1113 mSDsluCounter, 18505 mSDsCounter, 0 mSdLazyCounter, 23293 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 19207 SdHoareTripleChecker+Invalid, 23495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 23293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:32:27,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 19207 Invalid, 23495 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [202 Valid, 23293 Invalid, 0 Unknown, 0 Unchecked, 47.3s Time] [2023-12-02 14:32:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2023-12-02 14:32:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1462. [2023-12-02 14:32:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 861 states have (on average 1.8617886178861789) internal successors, (1603), 1450 states have internal predecessors, (1603), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:32:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1629 transitions. [2023-12-02 14:32:27,251 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1629 transitions. Word has length 81 [2023-12-02 14:32:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:32:27,251 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1629 transitions. [2023-12-02 14:32:27,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 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 14:32:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1629 transitions. [2023-12-02 14:32:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 14:32:27,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:32:27,253 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] [2023-12-02 14:32:27,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-12-02 14:32:27,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 14:32:27,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Forceful destruction successful, exit code 0 [2023-12-02 14:32:27,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:32:27,856 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:32:27,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:32:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1929452171, now seen corresponding path program 1 times [2023-12-02 14:32:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:32:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199927876] [2023-12-02 14:32:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:27,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 14:32:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:32:27,858 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:32:27,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Waiting until timeout for monitored process [2023-12-02 14:32:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:28,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 14:32:28,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:28,675 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 14:32:28,807 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:32:28,807 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 14:32:28,838 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 14:32:28,952 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 14:32:30,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:30,090 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 14:32:30,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:30,216 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 14:32:30,232 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 14:32:30,270 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 14:32:30,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:32:32,378 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (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_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:32:32,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2965 (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~mem33#1.base| v_ArrVal_2965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:32:32,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:32:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199927876] [2023-12-02 14:32:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199927876] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1124281879] [2023-12-02 14:32:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:32:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:32:32,836 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:32:32,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 14:32:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:36,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 14:32:36,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:36,641 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 14:32:36,991 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:32:36,991 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 14:32:37,085 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 14:32:37,266 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 20 treesize of output 12 [2023-12-02 14:32:38,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:32:38,304 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 36 treesize of output 35 [2023-12-02 14:32:38,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:32:38,496 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 36 treesize of output 35 [2023-12-02 14:32:38,516 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 27 treesize of output 15 [2023-12-02 14:32:38,530 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 14:32:38,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:32:38,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3375) |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 14:32:38,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3375 (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_3375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:32:39,042 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3421 (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~mem33#1.base| v_ArrVal_3421))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3375)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:32:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1124281879] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823411809] [2023-12-02 14:32:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:32:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:32:39,047 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:32:39,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 14:32:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:39,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 14:32:39,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:39,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:32:39,714 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 14:32:39,757 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 14:32:40,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:40,246 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 14:32:40,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:32:40,344 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 14:32:40,418 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 14:32:40,423 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 14:32:40,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:32:40,456 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:32:40,457 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 14:32:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823411809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:41,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:32:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 23 [2023-12-02 14:32:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106097467] [2023-12-02 14:32:41,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:32:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 14:32:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:32:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 14:32:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=583, Unknown=16, NotChecked=270, Total=992 [2023-12-02 14:32:41,130 INFO L87 Difference]: Start difference. First operand 1462 states and 1629 transitions. Second operand has 24 states, 20 states have (on average 7.75) internal successors, (155), 24 states have internal predecessors, (155), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:32:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:32:57,638 INFO L93 Difference]: Finished difference Result 2212 states and 2412 transitions. [2023-12-02 14:32:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 14:32:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 7.75) internal successors, (155), 24 states have internal predecessors, (155), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 105 [2023-12-02 14:32:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:32:57,644 INFO L225 Difference]: With dead ends: 2212 [2023-12-02 14:32:57,644 INFO L226 Difference]: Without dead ends: 2212 [2023-12-02 14:32:57,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 296 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=139, Invalid=677, Unknown=16, NotChecked=290, Total=1122 [2023-12-02 14:32:57,645 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 1559 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 6803 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 6414 SdHoareTripleChecker+Invalid, 6860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 6803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:32:57,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 6414 Invalid, 6860 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 6803 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2023-12-02 14:32:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2023-12-02 14:32:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 1461. [2023-12-02 14:32:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 861 states have (on average 1.8606271777003485) internal successors, (1602), 1449 states have internal predecessors, (1602), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:32:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1628 transitions. [2023-12-02 14:32:57,671 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1628 transitions. Word has length 105 [2023-12-02 14:32:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:32:57,672 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1628 transitions. [2023-12-02 14:32:57,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 7.75) internal successors, (155), 24 states have internal predecessors, (155), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:32:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1628 transitions. [2023-12-02 14:32:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 14:32:57,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:32:57,673 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] [2023-12-02 14:32:57,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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)] Ended with exit code 0 [2023-12-02 14:32:57,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 14:32:58,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 14:32:58,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:32:58,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:32:58,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:32:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1929452170, now seen corresponding path program 1 times [2023-12-02 14:32:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:32:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283853647] [2023-12-02 14:32:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:58,275 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 14:32:58,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:32:58,276 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:32:58,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (30)] Waiting until timeout for monitored process [2023-12-02 14:32:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:59,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 14:32:59,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:59,206 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 14:32:59,352 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:32:59,352 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 14:32:59,359 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 14:32:59,387 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 14:32:59,408 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 14:32:59,534 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 14:32:59,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 9 treesize of output 3 [2023-12-02 14:33:00,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:00,346 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 14:33:00,351 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 14:33:00,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:00,454 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 14:33:00,466 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 14:33:00,481 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 14:33:00,489 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 14:33:00,515 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 14:33:00,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:33:00,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:33:00,695 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_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:33:02,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4421))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4422) .cse0 v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4422 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4422) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4329) |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 14:33:02,169 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:33:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283853647] [2023-12-02 14:33:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283853647] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:33:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [604178993] [2023-12-02 14:33:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:33:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:33:02,171 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:33:02,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 14:33:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:33:06,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-02 14:33:06,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:33:06,195 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 14:33:06,205 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 14:33:06,744 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 14:33:06,744 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 18 [2023-12-02 14:33:06,773 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:33:06,773 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 14:33:06,863 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 15 treesize of output 1 [2023-12-02 14:33:06,868 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 14:33:06,967 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 17 treesize of output 9 [2023-12-02 14:33:07,040 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 7 treesize of output 3 [2023-12-02 14:33:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:33:07,768 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 16 treesize of output 11 [2023-12-02 14:33:08,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2023-12-02 14:33:08,092 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 35 treesize of output 11 [2023-12-02 14:33:08,248 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 17 treesize of output 9 [2023-12-02 14:33:08,256 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 7 treesize of output 3 [2023-12-02 14:33:08,377 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 14:33:08,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:33:08,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 231 treesize of output 159 [2023-12-02 14:33:10,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_59 (_ BitVec 32)) (v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4884))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_59 (store (select .cse1 v_arrayElimCell_59) (bvadd .cse2 (_ bv16 32)) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_59))))))) (forall ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4884) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (or (not (bvule (bvadd .cse4 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_4837 (_ BitVec 32)) (v_ArrVal_4835 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (store .cse5 (bvadd .cse4 (_ bv16 32)) v_ArrVal_4835) .cse3)) (select |c_#length| v_ArrVal_4837))) (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd .cse4 (_ bv8 32)))))))) (forall ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4884))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd .cse6 (_ bv8 32))) (forall ((v_arrayElimCell_59 (_ BitVec 32)) (v_ArrVal_4835 (_ BitVec 32))) (let ((.cse8 (select |c_#length| v_arrayElimCell_59))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse7 v_arrayElimCell_59 (store (select .cse7 v_arrayElimCell_59) (bvadd .cse6 (_ bv16 32)) v_ArrVal_4835)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse8) (not (bvule (bvadd .cse6 (_ bv20 32)) .cse8))))))))) (forall ((v_arrayElimCell_59 (_ BitVec 32)) (v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4884))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (select |c_#length| v_arrayElimCell_59))) (or (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_59) (forall ((v_ArrVal_4835 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store .cse9 v_arrayElimCell_59 (store (select .cse9 v_arrayElimCell_59) (bvadd .cse10 (_ bv16 32)) v_ArrVal_4835)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse11)) (not (bvule (bvadd .cse10 (_ bv20 32)) .cse11)))))) (forall ((v_arrayElimCell_59 (_ BitVec 32)) (v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4884))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse13 (select |c_#length| v_arrayElimCell_59))) (or (forall ((v_ArrVal_4835 (_ BitVec 32))) (let ((.cse12 (bvadd (_ bv8 32) (select (select (store .cse14 v_arrayElimCell_59 (store (select .cse14 v_arrayElimCell_59) (bvadd .cse15 (_ bv16 32)) v_ArrVal_4835)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (or (forall ((v_ArrVal_4837 (_ BitVec 32))) (bvule .cse12 (select |c_#length| v_ArrVal_4837))) (bvule .cse12 .cse13)))) (not (bvule (bvadd .cse15 (_ bv20 32)) .cse13)))))))) is different from false [2023-12-02 14:33:11,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [604178993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:33:11,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901092270] [2023-12-02 14:33:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:33:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:33:11,130 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:33:11,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 14:33:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:33:11,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 14:33:11,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:33:12,128 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 14:33:12,143 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:33:12,144 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 14:33:12,156 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 14:33:12,174 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 14:33:12,243 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 14:33:12,248 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 14:33:12,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:12,970 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 14:33:12,981 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 14:33:13,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:13,078 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 14:33:13,091 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 14:33:13,104 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 14:33:13,111 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 14:33:13,116 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 14:33:13,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:33:13,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5339) |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 14:33:13,205 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_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:33:14,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5431))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5430) .cse0 v_ArrVal_5339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5430) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5339) |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 14:33:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901092270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:33:14,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:33:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 20 [2023-12-02 14:33:14,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238446541] [2023-12-02 14:33:14,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:33:14,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 14:33:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:33:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 14:33:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=534, Unknown=7, NotChecked=364, Total=992 [2023-12-02 14:33:14,498 INFO L87 Difference]: Start difference. First operand 1461 states and 1628 transitions. Second operand has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 21 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:33:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:33:49,150 INFO L93 Difference]: Finished difference Result 2210 states and 2408 transitions. [2023-12-02 14:33:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:33:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 21 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-12-02 14:33:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:33:49,157 INFO L225 Difference]: With dead ends: 2210 [2023-12-02 14:33:49,157 INFO L226 Difference]: Without dead ends: 2210 [2023-12-02 14:33:49,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=160, Invalid=917, Unknown=7, NotChecked=476, Total=1560 [2023-12-02 14:33:49,159 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 2469 mSDsluCounter, 4847 mSDsCounter, 0 mSdLazyCounter, 12839 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2487 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 12880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:33:49,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2487 Valid, 5342 Invalid, 12880 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 12839 Invalid, 0 Unknown, 0 Unchecked, 33.6s Time] [2023-12-02 14:33:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2023-12-02 14:33:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1460. [2023-12-02 14:33:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 861 states have (on average 1.859465737514518) internal successors, (1601), 1448 states have internal predecessors, (1601), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:33:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1627 transitions. [2023-12-02 14:33:49,194 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1627 transitions. Word has length 105 [2023-12-02 14:33:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:33:49,195 INFO L495 AbstractCegarLoop]: Abstraction has 1460 states and 1627 transitions. [2023-12-02 14:33:49,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 21 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:33:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1627 transitions. [2023-12-02 14:33:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 14:33:49,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:33:49,197 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] [2023-12-02 14:33:49,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 14:33:49,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (30)] Ended with exit code 0 [2023-12-02 14:33:49,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 14:33:49,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:33:49,798 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:33:49,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:33:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1224564830, now seen corresponding path program 1 times [2023-12-02 14:33:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:33:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664519604] [2023-12-02 14:33:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:49,799 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 14:33:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:33:49,800 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:33:49,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (33)] Waiting until timeout for monitored process [2023-12-02 14:33:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:33:50,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 14:33:50,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:33:50,728 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 14:33:50,861 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:33:50,861 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 14:33:50,896 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 14:33:50,992 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 14:33:51,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:51,962 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 14:33:52,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:52,099 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 14:33:52,187 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:33:52,187 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 14:33:52,204 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 14:33:52,245 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 14:33:52,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:33:52,312 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5856 (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_5856) |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 14:33:52,324 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5856 (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_5856) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:33:52,339 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5856 (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~mem35#1.base| v_ArrVal_5855))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5856)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:33:52,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5856 (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_5855))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5856)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:33:52,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5856 (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~mem33#1.base| v_ArrVal_5902))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5855)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5856)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:33:52,809 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:33:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664519604] [2023-12-02 14:33:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664519604] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:33:52,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1197753652] [2023-12-02 14:33:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:33:52,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:33:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:33:52,811 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:33:52,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 14:34:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:34:19,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-02 14:34:19,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:34:19,331 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 14:34:19,662 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:34:19,662 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 14:34:19,747 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 14:34:19,756 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 14:34:19,893 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 27 treesize of output 15 [2023-12-02 14:34:19,971 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 14:34:21,035 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 16 treesize of output 11 [2023-12-02 14:34:21,426 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-12-02 14:34:21,431 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 35 treesize of output 11 [2023-12-02 14:34:21,475 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 7 treesize of output 3 [2023-12-02 14:34:21,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2023-12-02 14:34:21,757 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 19 treesize of output 11 [2023-12-02 14:34:21,805 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 14:34:21,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:34:25,171 INFO L349 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2023-12-02 14:34:25,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 923 treesize of output 804 [2023-12-02 14:35:44,398 WARN L293 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 148 DAG size of output: 66 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 14:35:44,398 INFO L349 Elim1Store]: treesize reduction 907, result has 18.9 percent of original size [2023-12-02 14:35:44,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 876 treesize of output 986 [2023-12-02 14:35:44,836 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-02 14:35:44,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 1512 treesize of output 1360 [2023-12-02 14:35:44,975 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 14:36:02,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:36:02,552 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 565663 treesize of output 447597 [2023-12-02 14:36:15,382 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse18 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv1 32))) (.cse10 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) (.cse5 (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) (.cse3 (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~user~0#1.base|) (_ bv1 1))))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_prenex_58 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_prenex_58) (_ bv1 1)) (_ bv0 1))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_61 (_ BitVec 32))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse1 (select .cse0 .cse2))) (= (select (store .cse0 (bvadd (_ bv16 32) .cse1) v_prenex_61) .cse2) (bvadd (_ bv10 32) .cse1)))))) .cse3) (or .cse3 (and (or (forall ((v_DerPreprocessor_491 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_DerPreprocessor_491) (_ bv1 1)) (_ bv0 1))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (_ BitVec 32))) (let ((.cse7 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse6 (select .cse7 .cse2))) (let ((.cse4 (select (store .cse7 (bvadd (_ bv16 32) .cse6) v_prenex_36) .cse2))) (or (not (= .cse4 .cse5)) (= .cse4 (bvadd (_ bv11 32) .cse6)))))))) (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (_ BitVec 32))) (let ((.cse11 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse8 (select .cse11 .cse2))) (let ((.cse9 (select (store .cse11 (bvadd (_ bv16 32) .cse8) v_prenex_36) .cse2))) (or (= (bvadd (_ bv10 32) .cse8) .cse9) (not (= .cse9 .cse10))))))) (forall ((v_DerPreprocessor_492 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_DerPreprocessor_492) (_ bv1 1))))) (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (_ BitVec 32))) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse14 (select .cse15 .cse2))) (let ((.cse13 (select (store .cse15 (bvadd (_ bv16 32) .cse14) v_prenex_36) .cse2))) (or (not (= .cse12 .cse13)) (= (bvadd .cse14 (_ bv12 32)) .cse13)))))) (forall ((v_DerPreprocessor_490 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_DerPreprocessor_490) (_ bv1 1))))) (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (_ BitVec 32))) (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse16 (select .cse19 .cse2))) (let ((.cse17 (select (store .cse19 (bvadd (_ bv16 32) .cse16) v_prenex_36) .cse2))) (or (= (bvadd .cse16 (_ bv9 32)) .cse17) (not (= .cse17 .cse18))))))) (forall ((v_DerPreprocessor_493 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_DerPreprocessor_493) (_ bv1 1)) (_ bv0 1)))))) (or (and (or (forall ((v_prenex_31 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_prenex_31) (_ bv1 1)) (_ bv0 1))) (forall ((v_prenex_30 (_ BitVec 32)) (v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse20 (select .cse21 .cse2))) (or (= (bvadd (_ bv8 32) .cse20) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= .cse12 (select (store .cse21 (bvadd (_ bv16 32) .cse20) v_prenex_30) .cse2)))))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse22 (select .cse23 .cse2))) (or (= (bvadd (_ bv8 32) .cse22) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= .cse10 (select (store .cse23 (bvadd (_ bv16 32) .cse22) v_prenex_30) .cse2))))))) (forall ((v_prenex_33 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_33) (_ bv1 1))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse24 (select .cse25 .cse2))) (or (= (bvadd (_ bv8 32) .cse24) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= .cse18 (select (store .cse25 (bvadd (_ bv16 32) .cse24) v_prenex_30) .cse2))))))) (forall ((v_prenex_34 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_34) (_ bv1 1))))) (or (forall ((v_prenex_30 (_ BitVec 32)) (v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse26 (select .cse27 .cse2))) (or (= (bvadd (_ bv8 32) .cse26) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= .cse5 (select (store .cse27 (bvadd (_ bv16 32) .cse26) v_prenex_30) .cse2))))))) (forall ((v_prenex_32 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_32) (_ bv1 1)))))) .cse3) (or .cse3 (and (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_53 (_ BitVec 32))) (let ((.cse29 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse28 (select .cse29 .cse2))) (or (= (bvadd (_ bv8 32) .cse28) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= (select (store .cse29 (bvadd (_ bv16 32) .cse28) v_prenex_53) .cse2) .cse18)))))) (forall ((v_DerPreprocessor_506 (_ BitVec 32))) (= (bvadd (_ bv1 1) (select |c_#valid| v_DerPreprocessor_506)) (_ bv0 1)))) (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_53 (_ BitVec 32))) (let ((.cse31 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse30 (select .cse31 .cse2))) (or (= (bvadd (_ bv8 32) .cse30) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= (select (store .cse31 (bvadd (_ bv16 32) .cse30) v_prenex_53) .cse2) .cse10)))))) (forall ((v_DerPreprocessor_505 (_ BitVec 32))) (= (bvadd (_ bv1 1) (select |c_#valid| v_DerPreprocessor_505)) (_ bv0 1)))) (or (forall ((v_DerPreprocessor_503 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_DerPreprocessor_503) (_ bv1 1)) (_ bv0 1))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_53 (_ BitVec 32))) (let ((.cse33 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse32 (select .cse33 .cse2))) (or (= (bvadd (_ bv8 32) .cse32) |c_ULTIMATE.start_main_~user~0#1.offset|) (not (= .cse12 (select (store .cse33 (bvadd (_ bv16 32) .cse32) v_prenex_53) .cse2)))))))) (or (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_53 (_ BitVec 32))) (let ((.cse34 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse35 (select .cse34 .cse2))) (or (not (= (select (store .cse34 (bvadd (_ bv16 32) .cse35) v_prenex_53) .cse2) .cse5)) (= (bvadd (_ bv8 32) .cse35) |c_ULTIMATE.start_main_~user~0#1.offset|))))) (forall ((v_DerPreprocessor_504 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_DerPreprocessor_504) (_ bv1 1)) (_ bv0 1)))))) (or (forall ((v_prenex_39 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_39) (_ bv1 1)))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (_ BitVec 32))) (not (let ((.cse37 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse36 (select .cse37 .cse2))) (= (bvadd .cse36 (_ bv9 32)) (select (store .cse37 (bvadd (_ bv16 32) .cse36) v_prenex_40) .cse2)))))) .cse3) (or .cse3 (forall ((v_prenex_37 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_37) (_ bv1 1)))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (_ BitVec 32))) (not (let ((.cse38 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse39 (select .cse38 .cse2))) (= (select (store .cse38 (bvadd (_ bv16 32) .cse39) v_prenex_38) .cse2) (bvadd .cse39 (_ bv12 32)))))))) (or .cse3 (forall ((v_prenex_54 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_prenex_54) (_ bv1 1)) (_ bv0 1))) (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_55 (_ BitVec 32))) (not (let ((.cse41 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse40 (select .cse41 .cse2))) (= (bvadd (_ bv10 32) .cse40) (select (store .cse41 (bvadd (_ bv16 32) .cse40) v_prenex_55) .cse2))))))) (or .cse3 (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (not (let ((.cse43 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse42 (select .cse43 .cse2))) (= (bvadd .cse42 (_ bv9 32)) (select (store .cse43 (bvadd (_ bv16 32) .cse42) v_prenex_46) .cse2)))))) (forall ((v_prenex_42 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_prenex_42) (_ bv1 1))))) (or .cse3 (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_51 (_ BitVec 32))) (not (let ((.cse44 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse45 (select .cse44 .cse2))) (= (select (store .cse44 (bvadd (_ bv16 32) .cse45) v_prenex_51) .cse2) (bvadd (_ bv11 32) .cse45)))))) (forall ((v_prenex_50 (_ BitVec 32))) (= (bvadd (select |c_#valid| v_prenex_50) (_ bv1 1)) (_ bv0 1)))) (or (forall ((v_DerPreprocessor_477 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| v_DerPreprocessor_477) (_ bv1 1)))) .cse3 (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (_ BitVec 32))) (not (let ((.cse47 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6382) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse46 (select .cse47 .cse2))) (= (bvadd (_ bv11 32) .cse46) (select (store .cse47 (bvadd (_ bv16 32) .cse46) v_ArrVal_6330) .cse2))))))))) is different from true [2023-12-02 14:36:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1197753652] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:36:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294692117] [2023-12-02 14:36:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:36:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:36:15,388 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:36:15,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 14:36:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:16,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 14:36:16,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:36:16,233 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:36:16,234 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 14:36:16,323 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 14:36:17,044 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:17,044 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 14:36:17,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:17,226 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 14:36:17,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:17,400 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 14:36:17,591 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 14:36:17,596 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 14:36:17,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:36:17,625 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:36:17,625 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 14:36:17,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6805 (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_6805) |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 14:36:17,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6805 (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_6805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 14:36:17,668 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6804)) (.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_6805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 14:36:17,682 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 14:36:18,186 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6851 (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~mem33#1.base| v_ArrVal_6851))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6804)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 14:36:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294692117] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:36:18,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:36:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-12-02 14:36:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189867417] [2023-12-02 14:36:18,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:36:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 14:36:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:36:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 14:36:18,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1115, Unknown=12, NotChecked=858, Total=2162 [2023-12-02 14:36:18,193 INFO L87 Difference]: Start difference. First operand 1460 states and 1627 transitions. Second operand has 31 states, 27 states have (on average 6.111111111111111) internal successors, (165), 31 states have internal predecessors, (165), 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 14:36:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:36:47,110 INFO L93 Difference]: Finished difference Result 2210 states and 2410 transitions. [2023-12-02 14:36:47,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 14:36:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.111111111111111) internal successors, (165), 31 states have internal predecessors, (165), 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 107 [2023-12-02 14:36:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:36:47,115 INFO L225 Difference]: With dead ends: 2210 [2023-12-02 14:36:47,115 INFO L226 Difference]: Without dead ends: 2210 [2023-12-02 14:36:47,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=261, Invalid=1577, Unknown=12, NotChecked=1012, Total=2862 [2023-12-02 14:36:47,117 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 2470 mSDsluCounter, 8707 mSDsCounter, 0 mSdLazyCounter, 10490 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 9402 SdHoareTripleChecker+Invalid, 10572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 10490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:36:47,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 9402 Invalid, 10572 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 10490 Invalid, 0 Unknown, 0 Unchecked, 27.7s Time] [2023-12-02 14:36:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2023-12-02 14:36:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1459. [2023-12-02 14:36:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 861 states have (on average 1.8583042973286876) internal successors, (1600), 1447 states have internal predecessors, (1600), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:36:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1626 transitions. [2023-12-02 14:36:47,132 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1626 transitions. Word has length 107 [2023-12-02 14:36:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:36:47,132 INFO L495 AbstractCegarLoop]: Abstraction has 1459 states and 1626 transitions. [2023-12-02 14:36:47,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.111111111111111) internal successors, (165), 31 states have internal predecessors, (165), 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 14:36:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1626 transitions. [2023-12-02 14:36:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 14:36:47,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:36:47,133 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] [2023-12-02 14:36:47,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (33)] Ended with exit code 0 [2023-12-02 14:36:47,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 14:36:47,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 14:36:47,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:36:47,734 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:36:47,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:36:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1224564831, now seen corresponding path program 1 times [2023-12-02 14:36:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:36:47,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917585006] [2023-12-02 14:36:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:47,735 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 14:36:47,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:36:47,736 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:36:47,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (36)] Waiting until timeout for monitored process [2023-12-02 14:36:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:48,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 14:36:48,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:36:48,867 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 14:36:49,014 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:36:49,014 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 14:36:49,023 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 14:36:49,054 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 14:36:49,065 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 14:36:49,192 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 14:36:49,197 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 14:36:50,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:50,005 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 14:36:50,020 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 14:36:50,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:50,149 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 14:36:50,163 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 14:36:50,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:36:50,261 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 14:36:50,271 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 14:36:50,289 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 14:36:50,294 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 14:36:50,335 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 14:36:50,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:36:50,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:36:50,615 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_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:36:50,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7322) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7321))) (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~mem35#1.base| v_ArrVal_7322) .cse2 v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 14:36:51,045 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_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7322) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7321))) (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_7322) .cse3 v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 14:36:52,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7416))) (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~mem33#1.base| v_ArrVal_7415) .cse1 v_ArrVal_7322) (select (select (store .cse2 .cse1 v_ArrVal_7321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7323))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7416))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7321))) (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~mem33#1.base| v_ArrVal_7415) .cse4 v_ArrVal_7322) .cse5 v_ArrVal_7323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 14:36:52,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:36:52,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917585006] [2023-12-02 14:36:52,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917585006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:36:52,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021034211] [2023-12-02 14:36:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:52,523 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:36:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:36:52,524 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:36:52,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 14:39:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:39:28,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 14:39:28,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:39:28,369 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 14:39:28,747 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:39:28,747 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 14:39:28,763 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 14:39:28,837 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 14:39:28,845 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 14:39:29,058 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 14:39:29,064 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 14:39:29,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:39:29,887 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 14:39:29,901 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 14:39:30,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:39:30,097 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 14:39:30,102 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 14:39:30,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:39:30,235 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 14:39:30,243 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 14:39:30,263 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 14:39:30,268 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 14:39:30,272 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 14:39:30,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:39:30,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:39:30,367 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_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:39:30,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7887))) (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~mem35#1.base| v_ArrVal_7886) .cse0 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7886) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7888) |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 14:39:30,518 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_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7887))) (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_7886) .cse1 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7886) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 14:39:32,406 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7981))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7887))) (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~mem33#1.base| v_ArrVal_7980) .cse0 v_ArrVal_7886) .cse1 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7981))) (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~mem33#1.base| v_ArrVal_7980) .cse6 v_ArrVal_7886) (select (select (store .cse7 .cse6 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7888))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 14:39:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1021034211] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:39:32,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637091358] [2023-12-02 14:39:32,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:39:32,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:39:32,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:39:32,425 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:39:32,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 14:39:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:39:33,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 14:39:33,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:39:33,385 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 14:39:33,406 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:39:33,406 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 14:39:33,421 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 14:39:33,433 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 14:39:33,507 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 14:39:33,513 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 14:39:34,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:39:34,457 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 14:39:34,473 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 14:39:34,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:39:34,569 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 14:39:34,585 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 14:39:34,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:39:34,645 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 14:39:34,654 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 14:39:34,681 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 14:39:34,688 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 14:39:34,697 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 14:39:34,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:39:34,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8452) |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~mem36#1.base| v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8452) |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 14:39:34,808 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_8452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:39:34,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8451))) (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~mem35#1.base| v_ArrVal_8450) .cse0 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 14:39:35,023 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_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8450) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8451))) (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_8450) .cse3 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 14:39:36,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8544))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8451))) (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~mem33#1.base| v_ArrVal_8545) .cse0 v_ArrVal_8450) .cse1 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8544))) (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~mem33#1.base| v_ArrVal_8545) .cse6 v_ArrVal_8450) (select (select (store .cse7 .cse6 v_ArrVal_8451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8452))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 14:39:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637091358] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:39:36,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:39:36,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 17 [2023-12-02 14:39:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185053720] [2023-12-02 14:39:36,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:39:36,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 14:39:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:39:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 14:39:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=333, Unknown=15, NotChecked=750, Total=1190 [2023-12-02 14:39:36,690 INFO L87 Difference]: Start difference. First operand 1459 states and 1626 transitions. Second operand has 18 states, 15 states have (on average 9.666666666666666) internal successors, (145), 18 states have internal predecessors, (145), 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 14:39:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:39:57,227 INFO L93 Difference]: Finished difference Result 2208 states and 2406 transitions. [2023-12-02 14:39:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 14:39:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.666666666666666) internal successors, (145), 18 states have internal predecessors, (145), 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 107 [2023-12-02 14:39:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:39:57,232 INFO L225 Difference]: With dead ends: 2208 [2023-12-02 14:39:57,232 INFO L226 Difference]: Without dead ends: 2208 [2023-12-02 14:39:57,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=150, Invalid=597, Unknown=15, NotChecked=960, Total=1722 [2023-12-02 14:39:57,233 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 2456 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 6519 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 6556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:39:57,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2474 Valid, 3813 Invalid, 6556 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 6519 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2023-12-02 14:39:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-12-02 14:39:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1458. [2023-12-02 14:39:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 861 states have (on average 1.8571428571428572) internal successors, (1599), 1446 states have internal predecessors, (1599), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:39:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1625 transitions. [2023-12-02 14:39:57,256 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1625 transitions. Word has length 107 [2023-12-02 14:39:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:39:57,256 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 1625 transitions. [2023-12-02 14:39:57,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.666666666666666) internal successors, (145), 18 states have internal predecessors, (145), 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 14:39:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1625 transitions. [2023-12-02 14:39:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 14:39:57,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:39:57,257 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] [2023-12-02 14:39:57,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (36)] Ended with exit code 0 [2023-12-02 14:39:57,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 14:39:57,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-12-02 14:39:57,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:39:57,858 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:39:57,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:39:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -12012766, now seen corresponding path program 1 times [2023-12-02 14:39:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:39:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738141906] [2023-12-02 14:39:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:39:57,859 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 14:39:57,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:39:57,860 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:39:57,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (39)] Waiting until timeout for monitored process [2023-12-02 14:39:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:39:59,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 14:39:59,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:39:59,201 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 14:39:59,409 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:39:59,409 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 14:39:59,449 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 14:39:59,594 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 14:40:00,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:40:00,710 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 14:40:00,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:40:00,871 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 14:40:00,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:40:00,999 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 14:40:01,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:40:01,133 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 14:40:01,155 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 14:40:01,220 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 14:40:01,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:40:01,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8986) |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 14:40:01,340 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (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_8986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:40:01,361 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8985 (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_8985))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:40:01,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8985 (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_8985))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:40:01,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (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~mem35#1.base| v_ArrVal_8984))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:40:01,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (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_8984))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:40:01,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9032))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8985)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:40:01,947 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:40:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738141906] [2023-12-02 14:40:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738141906] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:40:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121754694] [2023-12-02 14:40:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:40:01,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:40:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:40:01,949 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:40:01,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 14:41:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:41:33,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 14:41:33,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:41:33,032 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 14:41:33,476 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:41:33,476 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 14:41:33,588 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 14:41:33,803 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 20 treesize of output 12 [2023-12-02 14:41:35,033 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:41:35,033 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 36 treesize of output 35 [2023-12-02 14:41:35,316 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:41:35,316 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 36 treesize of output 35 [2023-12-02 14:41:35,478 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:41:35,478 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 36 treesize of output 35 [2023-12-02 14:41:35,652 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:41:35,652 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 36 treesize of output 35 [2023-12-02 14:41:35,673 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 27 treesize of output 15 [2023-12-02 14:41:35,689 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 14:41:35,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:41:37,830 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 14:41:37,850 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| |c_ULTIMATE.start_main_#t~mem36#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)) (_ bv0 1))) is different from false [2023-12-02 14:41:37,870 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 14:41:37,894 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)))) (= (_ 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~mem35#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)))) is different from false [2023-12-02 14:41:37,919 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 14:41:38,434 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)))) (= (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~mem33#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)) (_ bv0 1))) is different from false [2023-12-02 14:41:38,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2121754694] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:41:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590556891] [2023-12-02 14:41:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:41:38,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:41:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:41:38,442 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:41:38,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 14:41:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:41:39,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 14:41:39,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:41:39,547 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:41:39,547 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 14:41:39,622 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 14:41:40,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:41:40,595 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 14:41:40,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:41:40,850 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 14:41:41,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:41:41,004 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 14:41:41,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:41:41,163 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 14:41:41,178 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 14:41:41,183 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 14:41:41,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:41:41,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9958) |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 14:41:41,221 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (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_9958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:41:41,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9957 (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_9957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:41:41,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9957 (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_9957))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:41:41,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9956 (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~mem35#1.base| v_ArrVal_9956))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9957)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:41:41,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9956 (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_9956))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9957)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:41:41,916 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 14:41:41,916 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 14:41:41,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9956 (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~mem33#1.base| v_ArrVal_10004))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9956)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9957)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9958)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 14:41:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590556891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:41:41,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:41:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 30 [2023-12-02 14:41:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43741315] [2023-12-02 14:41:41,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:41:41,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 14:41:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:41:41,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 14:41:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=913, Unknown=23, NotChecked=1620, Total=2756 [2023-12-02 14:41:41,942 INFO L87 Difference]: Start difference. First operand 1458 states and 1625 transitions. Second operand has 31 states, 27 states have (on average 6.185185185185185) internal successors, (167), 30 states have internal predecessors, (167), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:42:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:42:09,816 INFO L93 Difference]: Finished difference Result 2208 states and 2408 transitions. [2023-12-02 14:42:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 14:42:09,817 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.185185185185185) internal successors, (167), 30 states have internal predecessors, (167), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 109 [2023-12-02 14:42:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:42:09,823 INFO L225 Difference]: With dead ends: 2208 [2023-12-02 14:42:09,823 INFO L226 Difference]: Without dead ends: 2208 [2023-12-02 14:42:09,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=228, Invalid=1161, Unknown=23, NotChecked=1780, Total=3192 [2023-12-02 14:42:09,826 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 2439 mSDsluCounter, 7815 mSDsCounter, 0 mSdLazyCounter, 9625 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 8507 SdHoareTripleChecker+Invalid, 9682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 9625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:42:09,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 8507 Invalid, 9682 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 9625 Invalid, 0 Unknown, 0 Unchecked, 27.3s Time] [2023-12-02 14:42:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-12-02 14:42:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1457. [2023-12-02 14:42:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 861 states have (on average 1.8559814169570268) internal successors, (1598), 1445 states have internal predecessors, (1598), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 14:42:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1624 transitions. [2023-12-02 14:42:09,846 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1624 transitions. Word has length 109 [2023-12-02 14:42:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:42:09,847 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1624 transitions. [2023-12-02 14:42:09,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.185185185185185) internal successors, (167), 30 states have internal predecessors, (167), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:42:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1624 transitions. [2023-12-02 14:42:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 14:42:09,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:42:09,848 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] [2023-12-02 14:42:09,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 14:42:10,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 14:42:10,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (39)] Forceful destruction successful, exit code 0 [2023-12-02 14:42:10,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:42:10,448 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-12-02 14:42:10,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:42:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash -12012765, now seen corresponding path program 1 times [2023-12-02 14:42:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:42:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202989762] [2023-12-02 14:42:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:42:10,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 14:42:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:42:10,451 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 14:42:10,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/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 (42)] Waiting until timeout for monitored process [2023-12-02 14:42:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:42:11,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 14:42:11,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:42:11,756 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 14:42:11,941 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:42:11,942 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 14:42:11,952 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 14:42:12,000 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 14:42:12,013 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 14:42:12,159 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 14:42:12,166 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 14:42:13,122 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:42:13,122 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 14:42:13,140 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 14:42:13,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:42:13,300 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 14:42:13,318 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 14:42:13,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:42:13,444 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 14:42:13,452 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 14:42:13,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:42:13,604 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 14:42:13,612 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 14:42:13,637 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 14:42:13,646 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 14:42:13,689 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 14:42:13,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:42:13,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:42:13,957 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_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10494) |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 14:42:14,014 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (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_10491) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10492))) (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_10491) .cse2 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 14:42:14,074 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_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10492))) (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_10491) .cse1 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10491) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10494) |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 14:42:14,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10489))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10492))) (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~mem35#1.base| v_ArrVal_10490) .cse0 v_ArrVal_10491) .cse1 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10489))) (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~mem35#1.base| v_ArrVal_10490) .cse6 v_ArrVal_10491) (select (select (store .cse7 .cse6 v_ArrVal_10492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10494))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 14:42:14,237 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_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10489))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10492))) (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_10490) .cse1 v_ArrVal_10491) .cse2 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10489))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10490) .cse7 v_ArrVal_10491) (select (select (store .cse8 .cse7 v_ArrVal_10492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10494))) |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 14:42:15,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10585))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10489))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10492))) (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~mem33#1.base| v_ArrVal_10586) .cse0 v_ArrVal_10490) .cse1 v_ArrVal_10491) .cse2 v_ArrVal_10494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10585))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10489))) (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~mem33#1.base| v_ArrVal_10586) .cse8 v_ArrVal_10490) .cse9 v_ArrVal_10491) (select (select (store .cse10 .cse9 v_ArrVal_10492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10494))))) |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 14:42:15,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:42:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202989762] [2023-12-02 14:42:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202989762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:42:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [163454602] [2023-12-02 14:42:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:42:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:42:15,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:42:15,904 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:42:15,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af80fd8c-82db-43ca-8c84-01988842da94/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process