./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:37:09,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:37:09,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 19:37:09,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:37:09,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:37:09,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:37:09,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:37:09,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:37:09,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:37:09,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:37:09,253 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:37:09,253 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:37:09,254 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:37:09,254 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:37:09,254 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:37:09,255 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:37:09,255 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:37:09,256 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:37:09,256 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:37:09,257 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:37:09,257 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:37:09,263 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:37:09,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 19:37:09,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 19:37:09,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:37:09,264 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:37:09,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:37:09,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:37:09,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:37:09,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 19:37:09,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 19:37:09,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 19:37:09,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:37:09,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:37:09,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:37:09,268 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:37:09,268 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:37:09,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:37:09,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:37:09,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:37:09,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:37:09,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:37:09,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:37:09,269 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:37:09,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:37:09,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:37:09,270 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:37:09,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:37:09,270 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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2023-12-02 19:37:09,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:37:09,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:37:09,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:37:09,516 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:37:09,517 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:37:09,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2023-12-02 19:37:12,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:37:12,576 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:37:12,576 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2023-12-02 19:37:12,593 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/ef8f847a8/22038d6be6fc49e3aa9ce316c9c943bc/FLAG326e8c4f6 [2023-12-02 19:37:12,607 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/ef8f847a8/22038d6be6fc49e3aa9ce316c9c943bc [2023-12-02 19:37:12,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:37:12,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:37:12,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:12,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:37:12,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:37:12,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:12" (1/1) ... [2023-12-02 19:37:12,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f54970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:12, skipping insertion in model container [2023-12-02 19:37:12,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:12" (1/1) ... [2023-12-02 19:37:12,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:37:13,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:13,122 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 19:37:13,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63967320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:13, skipping insertion in model container [2023-12-02 19:37:13,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:13,123 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 19:37:13,125 INFO L158 Benchmark]: Toolchain (without parser) took 512.96ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 19:37:13,125 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:37:13,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.68ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 19:37:13,127 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.23ms. Allocated memory is still 104.9MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.68ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types 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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:37:14,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:37:15,012 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 19:37:15,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:37:15,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:37:15,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:37:15,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:37:15,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:37:15,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:37:15,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:37:15,049 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:37:15,049 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:37:15,050 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:37:15,050 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:37:15,051 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:37:15,051 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:37:15,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 19:37:15,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 19:37:15,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:37:15,053 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:37:15,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:37:15,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:37:15,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:37:15,060 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 19:37:15,060 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 19:37:15,060 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 19:37:15,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:37:15,061 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:37:15,061 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 19:37:15,062 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 19:37:15,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:37:15,062 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:37:15,063 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:37:15,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:37:15,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 19:37:15,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:37:15,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:37:15,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:37:15,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:37:15,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:37:15,065 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 19:37:15,065 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 19:37:15,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:37:15,065 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:37:15,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:37:15,066 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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2023-12-02 19:37:15,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:37:15,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:37:15,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:37:15,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:37:15,391 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:37:15,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2023-12-02 19:37:18,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:37:18,422 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:37:18,423 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2023-12-02 19:37:18,441 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/02558eb13/9aaa11caea354bef9688eebf5a03ebc6/FLAGe2c56324a [2023-12-02 19:37:18,455 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/data/02558eb13/9aaa11caea354bef9688eebf5a03ebc6 [2023-12-02 19:37:18,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:37:18,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:37:18,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:18,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:37:18,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:37:18,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:18" (1/1) ... [2023-12-02 19:37:18,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2442743a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:18, skipping insertion in model container [2023-12-02 19:37:18,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:18" (1/1) ... [2023-12-02 19:37:18,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:37:18,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:18,992 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 19:37:19,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:37:19,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:19,073 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:37:19,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:19,210 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:37:19,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19 WrapperNode [2023-12-02 19:37:19,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:19,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:37:19,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:37:19,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:37:19,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,285 INFO L138 Inliner]: procedures = 180, calls = 187, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 634 [2023-12-02 19:37:19,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:37:19,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:37:19,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:37:19,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:37:19,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:37:19,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:37:19,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:37:19,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:37:19,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (1/1) ... [2023-12-02 19:37:19,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:37:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:19,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:37:19,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:37:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 19:37:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 19:37:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 19:37:19,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 19:37:19,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:37:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:37:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 19:37:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 19:37:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:37:19,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:37:19,611 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:37:19,613 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:37:19,617 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 19:37:22,390 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:37:22,533 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:37:22,533 INFO L309 CfgBuilder]: Removed 31 assume(true) statements. [2023-12-02 19:37:22,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:37:22 BoogieIcfgContainer [2023-12-02 19:37:22,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:37:22,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:37:22,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:37:22,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:37:22,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:37:18" (1/3) ... [2023-12-02 19:37:22,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71930074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:37:22, skipping insertion in model container [2023-12-02 19:37:22,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:19" (2/3) ... [2023-12-02 19:37:22,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71930074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:37:22, skipping insertion in model container [2023-12-02 19:37:22,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:37:22" (3/3) ... [2023-12-02 19:37:22,542 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-1.i [2023-12-02 19:37:22,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:37:22,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2023-12-02 19:37:22,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:37:22,622 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;@11087f95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:37:22,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2023-12-02 19:37:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 607 states, 264 states have (on average 2.515151515151515) internal successors, (664), 601 states have internal predecessors, (664), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:37:22,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:22,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:37:22,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:22,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 33295515, now seen corresponding path program 1 times [2023-12-02 19:37:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623521497] [2023-12-02 19:37:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:22,654 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 19:37:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:22,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:22,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:22,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 19:37:22,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:22,803 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 19:37:22,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:22,804 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623521497] [2023-12-02 19:37:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623521497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959253223] [2023-12-02 19:37:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:22,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 19:37:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:22,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 19:37:22,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:37:22,843 INFO L87 Difference]: Start difference. First operand has 607 states, 264 states have (on average 2.515151515151515) internal successors, (664), 601 states have internal predecessors, (664), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:37:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:23,274 INFO L93 Difference]: Finished difference Result 597 states and 643 transitions. [2023-12-02 19:37:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 19:37:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 19:37:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:23,294 INFO L225 Difference]: With dead ends: 597 [2023-12-02 19:37:23,295 INFO L226 Difference]: Without dead ends: 596 [2023-12-02 19:37:23,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:37:23,300 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:23,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:37:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-12-02 19:37:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2023-12-02 19:37:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 259 states have (on average 2.3783783783783785) internal successors, (616), 590 states have internal predecessors, (616), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 642 transitions. [2023-12-02 19:37:23,370 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 642 transitions. Word has length 4 [2023-12-02 19:37:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:23,370 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 642 transitions. [2023-12-02 19:37:23,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:37:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 642 transitions. [2023-12-02 19:37:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:37:23,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:23,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:37:23,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:23,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:23,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:23,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 33295577, now seen corresponding path program 1 times [2023-12-02 19:37:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474759413] [2023-12-02 19:37:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:23,575 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 19:37:23,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:23,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:23,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:23,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:37:23,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:23,697 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 19:37:23,715 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 19:37:23,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:23,716 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474759413] [2023-12-02 19:37:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474759413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:23,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:23,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:23,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646709199] [2023-12-02 19:37:23,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:37:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:37:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:37:23,719 INFO L87 Difference]: Start difference. First operand 596 states and 642 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 19:37:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:24,747 INFO L93 Difference]: Finished difference Result 557 states and 604 transitions. [2023-12-02 19:37:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:37:24,748 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 19:37:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:24,751 INFO L225 Difference]: With dead ends: 557 [2023-12-02 19:37:24,751 INFO L226 Difference]: Without dead ends: 557 [2023-12-02 19:37:24,752 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 19:37:24,752 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 536 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:24,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 288 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:37:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-12-02 19:37:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 547. [2023-12-02 19:37:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 259 states have (on average 2.189189189189189) internal successors, (567), 541 states have internal predecessors, (567), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 593 transitions. [2023-12-02 19:37:24,771 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 593 transitions. Word has length 4 [2023-12-02 19:37:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:24,771 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 593 transitions. [2023-12-02 19:37:24,771 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 19:37:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 593 transitions. [2023-12-02 19:37:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:37:24,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:24,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:37:24,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:24,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:24,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:24,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 33295578, now seen corresponding path program 1 times [2023-12-02 19:37:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:24,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321866670] [2023-12-02 19:37:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:24,974 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 19:37:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:24,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:24,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:25,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:37:25,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:25,038 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 19:37:25,059 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 19:37:25,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:25,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321866670] [2023-12-02 19:37:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321866670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480572849] [2023-12-02 19:37:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:25,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:37:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:37:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:37:25,073 INFO L87 Difference]: Start difference. First operand 547 states and 593 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 19:37:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:26,676 INFO L93 Difference]: Finished difference Result 607 states and 657 transitions. [2023-12-02 19:37:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:37:26,678 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 19:37:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:26,681 INFO L225 Difference]: With dead ends: 607 [2023-12-02 19:37:26,682 INFO L226 Difference]: Without dead ends: 607 [2023-12-02 19:37:26,682 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 19:37:26,683 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 230 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:26,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 610 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 19:37:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-02 19:37:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 560. [2023-12-02 19:37:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 282 states have (on average 2.1773049645390072) internal successors, (614), 554 states have internal predecessors, (614), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 640 transitions. [2023-12-02 19:37:26,703 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 640 transitions. Word has length 4 [2023-12-02 19:37:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:26,703 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 640 transitions. [2023-12-02 19:37:26,703 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 19:37:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 640 transitions. [2023-12-02 19:37:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:37:26,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:26,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:37:26,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Forceful destruction successful, exit code 0 [2023-12-02 19:37:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:26,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:26,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1032985278, now seen corresponding path program 1 times [2023-12-02 19:37:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611471028] [2023-12-02 19:37:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:26,906 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 19:37:26,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:26,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:26,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:26,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 19:37:26,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:26,965 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 19:37:26,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:26,965 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611471028] [2023-12-02 19:37:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611471028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:26,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:26,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961380515] [2023-12-02 19:37:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:26,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:37:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:37:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:37:26,968 INFO L87 Difference]: Start difference. First operand 560 states and 640 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 19:37:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:27,717 INFO L93 Difference]: Finished difference Result 1076 states and 1216 transitions. [2023-12-02 19:37:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:37:27,719 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 19:37:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:27,725 INFO L225 Difference]: With dead ends: 1076 [2023-12-02 19:37:27,725 INFO L226 Difference]: Without dead ends: 1076 [2023-12-02 19:37:27,725 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 19:37:27,726 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 512 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:27,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1206 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:37:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-12-02 19:37:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 561. [2023-12-02 19:37:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 283 states have (on average 2.1731448763250882) internal successors, (615), 555 states have internal predecessors, (615), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 641 transitions. [2023-12-02 19:37:27,755 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 641 transitions. Word has length 5 [2023-12-02 19:37:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:27,755 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 641 transitions. [2023-12-02 19:37:27,755 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 19:37:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 641 transitions. [2023-12-02 19:37:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:37:27,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:27,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:27,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:27,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:27,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:27,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 897657347, now seen corresponding path program 1 times [2023-12-02 19:37:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443861682] [2023-12-02 19:37:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:27,958 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 19:37:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:27,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:27,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:28,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 19:37:28,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:28,060 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 19:37:28,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:28,060 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443861682] [2023-12-02 19:37:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443861682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:37:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526031136] [2023-12-02 19:37:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:37:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:37:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:37:28,063 INFO L87 Difference]: Start difference. First operand 561 states and 641 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 19:37:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:28,594 INFO L93 Difference]: Finished difference Result 522 states and 601 transitions. [2023-12-02 19:37:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:37:28,596 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 19:37:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:28,599 INFO L225 Difference]: With dead ends: 522 [2023-12-02 19:37:28,599 INFO L226 Difference]: Without dead ends: 522 [2023-12-02 19:37:28,599 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 19:37:28,600 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 70 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 889 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:37:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-12-02 19:37:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2023-12-02 19:37:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 268 states have (on average 2.1455223880597014) internal successors, (575), 516 states have internal predecessors, (575), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 601 transitions. [2023-12-02 19:37:28,614 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 601 transitions. Word has length 10 [2023-12-02 19:37:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:28,614 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 601 transitions. [2023-12-02 19:37:28,614 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 19:37:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 601 transitions. [2023-12-02 19:37:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:37:28,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:28,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:28,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:28,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:28,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash -639720195, now seen corresponding path program 1 times [2023-12-02 19:37:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:28,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322207493] [2023-12-02 19:37:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:28,820 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 19:37:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:28,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:28,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:28,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:37:28,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:28,936 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 19:37:28,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:28,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322207493] [2023-12-02 19:37:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322207493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:37:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078403722] [2023-12-02 19:37:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:28,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:28,938 INFO L87 Difference]: Start difference. First operand 522 states and 601 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 19:37:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:29,572 INFO L93 Difference]: Finished difference Result 508 states and 580 transitions. [2023-12-02 19:37:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:29,573 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 19:37:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:29,576 INFO L225 Difference]: With dead ends: 508 [2023-12-02 19:37:29,576 INFO L226 Difference]: Without dead ends: 508 [2023-12-02 19:37:29,576 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 19:37:29,577 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 58 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:29,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1290 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:37:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-02 19:37:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2023-12-02 19:37:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 267 states have (on average 2.0711610486891385) internal successors, (553), 501 states have internal predecessors, (553), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 579 transitions. [2023-12-02 19:37:29,587 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 579 transitions. Word has length 12 [2023-12-02 19:37:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:29,588 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 579 transitions. [2023-12-02 19:37:29,588 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 19:37:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 579 transitions. [2023-12-02 19:37:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:37:29,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:29,589 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 19:37:29,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Forceful destruction successful, exit code 0 [2023-12-02 19:37:29,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:29,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:29,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash 116096971, now seen corresponding path program 1 times [2023-12-02 19:37:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478504026] [2023-12-02 19:37:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:29,793 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 19:37:29,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:29,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:29,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:29,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:37:29,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:29,923 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 19:37:30,008 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 19:37:30,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:30,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478504026] [2023-12-02 19:37:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478504026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:30,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:37:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369625357] [2023-12-02 19:37:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:30,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:30,010 INFO L87 Difference]: Start difference. First operand 507 states and 579 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 19:37:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:31,322 INFO L93 Difference]: Finished difference Result 513 states and 586 transitions. [2023-12-02 19:37:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:31,322 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 19:37:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:31,325 INFO L225 Difference]: With dead ends: 513 [2023-12-02 19:37:31,325 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 19:37:31,326 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 19:37:31,326 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 471 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:31,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 423 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 19:37:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 19:37:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 503. [2023-12-02 19:37:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 267 states have (on average 2.056179775280899) internal successors, (549), 497 states have internal predecessors, (549), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 575 transitions. [2023-12-02 19:37:31,341 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 575 transitions. Word has length 26 [2023-12-02 19:37:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:31,341 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 575 transitions. [2023-12-02 19:37:31,341 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 19:37:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 575 transitions. [2023-12-02 19:37:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:37:31,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:31,343 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 19:37:31,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:31,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:31,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:31,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 116096972, now seen corresponding path program 1 times [2023-12-02 19:37:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355510332] [2023-12-02 19:37:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:31,544 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 19:37:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:31,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:31,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:31,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:37:31,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:31,651 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 19:37:31,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 19:37:31,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:31,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355510332] [2023-12-02 19:37:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355510332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:37:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876700906] [2023-12-02 19:37:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:31,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:31,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:31,840 INFO L87 Difference]: Start difference. First operand 503 states and 575 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 19:37:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:33,640 INFO L93 Difference]: Finished difference Result 546 states and 588 transitions. [2023-12-02 19:37:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:33,642 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 19:37:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:33,644 INFO L225 Difference]: With dead ends: 546 [2023-12-02 19:37:33,644 INFO L226 Difference]: Without dead ends: 546 [2023-12-02 19:37:33,644 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 19:37:33,645 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 167 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:33,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 776 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 19:37:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-12-02 19:37:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 499. [2023-12-02 19:37:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 267 states have (on average 2.041198501872659) internal successors, (545), 493 states have internal predecessors, (545), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 571 transitions. [2023-12-02 19:37:33,654 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 571 transitions. Word has length 26 [2023-12-02 19:37:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:33,655 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 571 transitions. [2023-12-02 19:37:33,655 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 19:37:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 571 transitions. [2023-12-02 19:37:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 19:37:33,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:33,656 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 19:37:33,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:33,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:33,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:33,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash 428105285, now seen corresponding path program 1 times [2023-12-02 19:37:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105601011] [2023-12-02 19:37:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:33,858 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 19:37:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:33,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:33,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:34,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:37:34,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:34,106 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 19:37:34,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:34,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105601011] [2023-12-02 19:37:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105601011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:37:34,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448845991] [2023-12-02 19:37:34,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:34,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:34,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:34,109 INFO L87 Difference]: Start difference. First operand 499 states and 571 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 19:37:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:34,688 INFO L93 Difference]: Finished difference Result 493 states and 561 transitions. [2023-12-02 19:37:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:34,690 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 19:37:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:34,693 INFO L225 Difference]: With dead ends: 493 [2023-12-02 19:37:34,693 INFO L226 Difference]: Without dead ends: 493 [2023-12-02 19:37:34,693 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 19:37:34,694 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 23 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:34,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1276 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:37:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-12-02 19:37:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2023-12-02 19:37:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 261 states have (on average 2.049808429118774) internal successors, (535), 487 states have internal predecessors, (535), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 561 transitions. [2023-12-02 19:37:34,706 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 561 transitions. Word has length 42 [2023-12-02 19:37:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:34,706 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 561 transitions. [2023-12-02 19:37:34,707 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 19:37:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 561 transitions. [2023-12-02 19:37:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 19:37:34,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:34,708 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 19:37:34,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:34,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:34,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash 162281766, now seen corresponding path program 1 times [2023-12-02 19:37:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376445838] [2023-12-02 19:37:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:34,910 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 19:37:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:34,911 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:34,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:35,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:37:35,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:35,299 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 19:37:35,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:35,299 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376445838] [2023-12-02 19:37:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376445838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357392779] [2023-12-02 19:37:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:35,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:37:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:35,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:37:35,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:37:35,301 INFO L87 Difference]: Start difference. First operand 493 states and 561 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 19:37:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:35,795 INFO L93 Difference]: Finished difference Result 536 states and 604 transitions. [2023-12-02 19:37:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:37:35,797 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 19:37:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:35,800 INFO L225 Difference]: With dead ends: 536 [2023-12-02 19:37:35,800 INFO L226 Difference]: Without dead ends: 536 [2023-12-02 19:37:35,801 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 19:37:35,801 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 59 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:35,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 815 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:37:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-12-02 19:37:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-12-02 19:37:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 304 states have (on average 1.9013157894736843) internal successors, (578), 530 states have internal predecessors, (578), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 604 transitions. [2023-12-02 19:37:35,812 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 604 transitions. Word has length 46 [2023-12-02 19:37:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:35,813 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 604 transitions. [2023-12-02 19:37:35,813 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 19:37:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 604 transitions. [2023-12-02 19:37:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 19:37:35,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:35,815 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 19:37:35,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:36,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:36,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1704566160, now seen corresponding path program 1 times [2023-12-02 19:37:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357905268] [2023-12-02 19:37:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:36,020 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 19:37:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:36,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:36,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:36,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:37:36,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:36,262 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 19:37:36,267 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 19:37:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:36,710 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 19:37:36,726 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:37:36,727 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 19:37:36,746 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 19:37:36,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:36,746 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357905268] [2023-12-02 19:37:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357905268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:36,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:36,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:37:36,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889314622] [2023-12-02 19:37:36,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:36,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:36,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:36,748 INFO L87 Difference]: Start difference. First operand 536 states and 604 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 19:37:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:37,949 INFO L93 Difference]: Finished difference Result 508 states and 577 transitions. [2023-12-02 19:37:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:37,950 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 19:37:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:37,952 INFO L225 Difference]: With dead ends: 508 [2023-12-02 19:37:37,952 INFO L226 Difference]: Without dead ends: 508 [2023-12-02 19:37:37,953 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 19:37:37,953 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 354 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:37,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 250 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 19:37:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-02 19:37:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 475. [2023-12-02 19:37:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 281 states have (on average 1.7188612099644127) internal successors, (483), 469 states have internal predecessors, (483), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 509 transitions. [2023-12-02 19:37:37,962 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 509 transitions. Word has length 49 [2023-12-02 19:37:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:37,962 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 509 transitions. [2023-12-02 19:37:37,962 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 19:37:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 509 transitions. [2023-12-02 19:37:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 19:37:37,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:37,963 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 19:37:37,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:38,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:38,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:38,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1875317201, now seen corresponding path program 1 times [2023-12-02 19:37:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965039276] [2023-12-02 19:37:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:38,165 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 19:37:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:38,166 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:38,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:38,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:37:38,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:38,366 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 19:37:38,379 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 19:37:38,398 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 19:37:38,405 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 19:37:38,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:38,406 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965039276] [2023-12-02 19:37:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965039276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:37:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379266680] [2023-12-02 19:37:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:38,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:37:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:38,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:37:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:37:38,408 INFO L87 Difference]: Start difference. First operand 475 states and 509 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 19:37:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:39,832 INFO L93 Difference]: Finished difference Result 474 states and 508 transitions. [2023-12-02 19:37:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:37:39,834 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 19:37:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:39,837 INFO L225 Difference]: With dead ends: 474 [2023-12-02 19:37:39,837 INFO L226 Difference]: Without dead ends: 474 [2023-12-02 19:37:39,837 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 19:37:39,838 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 3 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:39,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1069 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 19:37:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-02 19:37:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2023-12-02 19:37:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 468 states have internal predecessors, (482), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 508 transitions. [2023-12-02 19:37:39,850 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 508 transitions. Word has length 53 [2023-12-02 19:37:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:39,850 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 508 transitions. [2023-12-02 19:37:39,850 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 19:37:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 508 transitions. [2023-12-02 19:37:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 19:37:39,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:39,851 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 19:37:39,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Forceful destruction successful, exit code 0 [2023-12-02 19:37:40,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:40,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:40,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1875317200, now seen corresponding path program 1 times [2023-12-02 19:37:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23778439] [2023-12-02 19:37:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:40,053 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 19:37:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:40,054 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:40,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:40,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:37:40,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:40,262 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 19:37:40,280 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 19:37:40,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 19:37:40,317 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 19:37:40,335 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 19:37:40,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:40,335 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23778439] [2023-12-02 19:37:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23778439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:37:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583579425] [2023-12-02 19:37:40,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:40,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:37:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:37:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:37:40,337 INFO L87 Difference]: Start difference. First operand 474 states and 508 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 19:37:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:42,249 INFO L93 Difference]: Finished difference Result 473 states and 507 transitions. [2023-12-02 19:37:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:37:42,251 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 19:37:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:42,254 INFO L225 Difference]: With dead ends: 473 [2023-12-02 19:37:42,254 INFO L226 Difference]: Without dead ends: 473 [2023-12-02 19:37:42,254 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 19:37:42,255 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:42,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1079 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 19:37:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-02 19:37:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2023-12-02 19:37:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 280 states have (on average 1.7178571428571427) internal successors, (481), 467 states have internal predecessors, (481), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 19:37:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 507 transitions. [2023-12-02 19:37:42,266 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 507 transitions. Word has length 53 [2023-12-02 19:37:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:42,266 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 507 transitions. [2023-12-02 19:37:42,266 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 19:37:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 507 transitions. [2023-12-02 19:37:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 19:37:42,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:42,267 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 19:37:42,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:42,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:42,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1334036501, now seen corresponding path program 1 times [2023-12-02 19:37:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301489436] [2023-12-02 19:37:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:42,469 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 19:37:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:42,469 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:42,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:42,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:37:42,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:42,687 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 19:37:42,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:37:42,688 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301489436] [2023-12-02 19:37:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301489436] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:42,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:37:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688526745] [2023-12-02 19:37:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:42,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:37:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:37:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:37:42,690 INFO L87 Difference]: Start difference. First operand 473 states and 507 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 19:37:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:43,355 INFO L93 Difference]: Finished difference Result 475 states and 510 transitions. [2023-12-02 19:37:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:37:43,357 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 19:37:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:43,360 INFO L225 Difference]: With dead ends: 475 [2023-12-02 19:37:43,360 INFO L226 Difference]: Without dead ends: 475 [2023-12-02 19:37:43,360 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 19:37:43,361 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:43,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1215 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:37:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-12-02 19:37:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2023-12-02 19:37:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 281 states have (on average 1.7188612099644127) internal successors, (483), 469 states have internal predecessors, (483), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:37:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 510 transitions. [2023-12-02 19:37:43,371 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 510 transitions. Word has length 59 [2023-12-02 19:37:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:43,372 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 510 transitions. [2023-12-02 19:37:43,372 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 19:37:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 510 transitions. [2023-12-02 19:37:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 19:37:43,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:43,373 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 19:37:43,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:43,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:43,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:43,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1373024552, now seen corresponding path program 1 times [2023-12-02 19:37:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075600289] [2023-12-02 19:37:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:43,574 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 19:37:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:43,575 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:43,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 19:37:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:43,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:37:43,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:43,817 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 19:37:43,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:43,883 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 19:37:43,883 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075600289] [2023-12-02 19:37:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075600289] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1376164819] [2023-12-02 19:37:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:37:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:37:43,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:37:43,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 19:37:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:44,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:37:44,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:44,280 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 19:37:44,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:44,305 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 19:37:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1376164819] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478458712] [2023-12-02 19:37:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:37:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:44,307 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:37:44,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 19:37:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:44,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:37:44,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:44,548 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 19:37:44,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:44,574 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 19:37:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478458712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:44,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:37:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 19:37:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377410533] [2023-12-02 19:37:44,575 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:37:44,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:37:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:37:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:37:44,576 INFO L87 Difference]: Start difference. First operand 475 states and 510 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 19:37:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:45,272 INFO L93 Difference]: Finished difference Result 484 states and 524 transitions. [2023-12-02 19:37:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:37:45,272 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 19:37:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:45,274 INFO L225 Difference]: With dead ends: 484 [2023-12-02 19:37:45,275 INFO L226 Difference]: Without dead ends: 484 [2023-12-02 19:37:45,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 19:37:45,275 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 7 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:45,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1213 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:37:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-12-02 19:37:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 483. [2023-12-02 19:37:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 288 states have (on average 1.7222222222222223) internal successors, (496), 476 states have internal predecessors, (496), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:37:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 523 transitions. [2023-12-02 19:37:45,287 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 523 transitions. Word has length 60 [2023-12-02 19:37:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:45,287 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 523 transitions. [2023-12-02 19:37:45,287 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 19:37:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 523 transitions. [2023-12-02 19:37:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 19:37:45,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:45,288 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 19:37:45,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 19:37:45,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 19:37:45,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 19:37:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:37:45,889 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:37:45,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1877942059, now seen corresponding path program 2 times [2023-12-02 19:37:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:37:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635699051] [2023-12-02 19:37:45,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:37:45,890 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 19:37:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:37:45,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:37:45,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 19:37:46,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:37:46,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:37:46,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:37:46,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:46,287 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 19:37:46,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:46,435 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 19:37:46,435 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635699051] [2023-12-02 19:37:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635699051] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1155471539] [2023-12-02 19:37:46,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:37:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:37:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:37:46,437 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:37:46,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 19:37:47,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:37:47,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:37:47,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:37:47,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:47,409 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 19:37:47,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:47,464 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 19:37:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1155471539] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864439579] [2023-12-02 19:37:47,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:37:47,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:37:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:47,466 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:37:47,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 19:37:59,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:37:59,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:37:59,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 19:37:59,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:59,682 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:37:59,683 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 19:37:59,708 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 19:37:59,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:37:59,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:38:00,032 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 19:38:00,071 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 19:38:00,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:00,194 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 19:38:00,195 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 19:38:00,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1258) |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 19:38:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864439579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:00,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 19:38:00,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 19:38:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781674164] [2023-12-02 19:38:00,212 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:00,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:38:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:38:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2023-12-02 19:38:00,215 INFO L87 Difference]: Start difference. First operand 483 states and 523 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 19:38:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:07,608 INFO L93 Difference]: Finished difference Result 507 states and 555 transitions. [2023-12-02 19:38:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 19:38:07,609 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 19:38:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:07,611 INFO L225 Difference]: With dead ends: 507 [2023-12-02 19:38:07,611 INFO L226 Difference]: Without dead ends: 505 [2023-12-02 19:38:07,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=455, Invalid=2410, Unknown=1, NotChecked=104, Total=2970 [2023-12-02 19:38:07,613 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 423 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 4228 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:07,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 2998 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4228 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-02 19:38:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-12-02 19:38:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 491. [2023-12-02 19:38:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 297 states have (on average 1.707070707070707) internal successors, (507), 484 states have internal predecessors, (507), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:38:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 534 transitions. [2023-12-02 19:38:07,621 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 534 transitions. Word has length 63 [2023-12-02 19:38:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:07,622 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 534 transitions. [2023-12-02 19:38:07,622 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 19:38:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 534 transitions. [2023-12-02 19:38:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 19:38:07,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:07,623 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 19:38:07,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 19:38:07,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:08,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 19:38:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:38:08,224 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:38:08,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1696198154, now seen corresponding path program 1 times [2023-12-02 19:38:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361572483] [2023-12-02 19:38:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:08,224 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 19:38:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:08,225 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:38:08,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 19:38:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:08,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 19:38:08,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:08,612 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 19:38:08,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:09,102 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 19:38:09,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361572483] [2023-12-02 19:38:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361572483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [548672895] [2023-12-02 19:38:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:38:09,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:38:09,104 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:38:09,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 19:38:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:09,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 19:38:09,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:09,626 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 19:38:09,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:09,752 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 19:38:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [548672895] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961918767] [2023-12-02 19:38:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:09,754 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:09,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 19:38:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:10,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:38:10,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:10,128 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 19:38:10,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:10,795 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 19:38:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961918767] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:10,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:38:10,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 19:38:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091128720] [2023-12-02 19:38:10,796 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:10,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 19:38:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 19:38:10,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 19:38:10,799 INFO L87 Difference]: Start difference. First operand 491 states and 534 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 19:38:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:15,594 INFO L93 Difference]: Finished difference Result 521 states and 579 transitions. [2023-12-02 19:38:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 19:38:15,594 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 19:38:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:15,596 INFO L225 Difference]: With dead ends: 521 [2023-12-02 19:38:15,597 INFO L226 Difference]: Without dead ends: 518 [2023-12-02 19:38:15,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 19:38:15,599 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 25 mSDsluCounter, 6424 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6827 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:15,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6827 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 19:38:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-02 19:38:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 509. [2023-12-02 19:38:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 315 states have (on average 1.6825396825396826) internal successors, (530), 502 states have internal predecessors, (530), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:38:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 557 transitions. [2023-12-02 19:38:15,608 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 557 transitions. Word has length 69 [2023-12-02 19:38:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:15,608 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 557 transitions. [2023-12-02 19:38:15,608 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 19:38:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 557 transitions. [2023-12-02 19:38:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 19:38:15,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:15,609 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 19:38:15,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 19:38:15,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 19:38:16,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Ended with exit code 0 [2023-12-02 19:38:16,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:38:16,210 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:38:16,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2014211126, now seen corresponding path program 2 times [2023-12-02 19:38:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951669451] [2023-12-02 19:38:16,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:38:16,211 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 19:38:16,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:16,212 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:38:16,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 19:38:16,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:38:16,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:16,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 19:38:16,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:17,104 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 19:38:17,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:19,181 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 19:38:19,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951669451] [2023-12-02 19:38:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951669451] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1774467797] [2023-12-02 19:38:19,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:38:19,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:38:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:38:19,183 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:38:19,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 19:38:20,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:38:20,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:20,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 19:38:20,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:20,324 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 19:38:20,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:20,801 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 19:38:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1774467797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258103870] [2023-12-02 19:38:20,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:38:20,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:20,802 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:20,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 19:38:32,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:38:32,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:32,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 19:38:32,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:32,691 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:32,692 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 19:38:32,697 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 19:38:32,794 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 19:38:32,808 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 19:38:33,126 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 19:38:33,131 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 19:38:33,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:38:33,681 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 19:38:33,692 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 19:38:33,873 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 19:38:33,880 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 19:38:33,969 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 19:38:33,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:34,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:38:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258103870] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:34,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 19:38:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 19:38:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180901269] [2023-12-02 19:38:34,843 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:34,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 19:38:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 19:38:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 19:38:34,846 INFO L87 Difference]: Start difference. First operand 509 states and 557 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 19:39:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:07,775 INFO L93 Difference]: Finished difference Result 581 states and 670 transitions. [2023-12-02 19:39:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-02 19:39:07,776 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 19:39:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:07,779 INFO L225 Difference]: With dead ends: 581 [2023-12-02 19:39:07,779 INFO L226 Difference]: Without dead ends: 574 [2023-12-02 19:39:07,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3457, Invalid=16568, Unknown=1, NotChecked=280, Total=20306 [2023-12-02 19:39:07,786 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 452 mSDsluCounter, 6436 mSDsCounter, 0 mSdLazyCounter, 11852 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 6659 SdHoareTripleChecker+Invalid, 11913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 11852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:07,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 6659 Invalid, 11913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 11852 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2023-12-02 19:39:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-02 19:39:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 544. [2023-12-02 19:39:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 351 states have (on average 1.6324786324786325) internal successors, (573), 537 states have internal predecessors, (573), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:39:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 600 transitions. [2023-12-02 19:39:07,800 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 600 transitions. Word has length 81 [2023-12-02 19:39:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:07,801 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 600 transitions. [2023-12-02 19:39:07,801 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 19:39:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 600 transitions. [2023-12-02 19:39:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 19:39:07,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:07,802 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 19:39:07,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 19:39:08,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 19:39:08,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 19:39:08,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:39:08,407 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:39:08,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -803709862, now seen corresponding path program 1 times [2023-12-02 19:39:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:39:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044491338] [2023-12-02 19:39:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:08,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:39:08,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:39:08,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:39:08,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 19:39:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:09,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 19:39:09,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:09,134 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 19:39:09,236 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:39:09,236 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 19:39:09,261 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 19:39:09,352 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 19:39:10,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:10,270 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 19:39:10,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:10,393 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 19:39:10,409 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 19:39:10,445 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 19:39:10,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:12,544 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2864 (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_2864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:39:12,961 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2910 (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_2910))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2864)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:39:12,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:39:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044491338] [2023-12-02 19:39:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044491338] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1641166446] [2023-12-02 19:39:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:39:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:39:12,965 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:39:12,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 19:39:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:16,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 19:39:16,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:16,416 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 19:39:16,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 19:39:16,910 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-02 19:39:16,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:39:16,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:39:17,589 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:39:17,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 41 [2023-12-02 19:39:17,764 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:39:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:39:17,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 19:39:17,834 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 19:39:17,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:20,338 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 19:39:20,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-12-02 19:39:20,348 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_3361))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2864)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 19:39:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1641166446] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926986193] [2023-12-02 19:39:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:20,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:20,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:39:20,351 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:39:20,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 19:39:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:20,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 19:39:20,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:20,860 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 19:39:20,962 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:39:20,962 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 19:39:21,005 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 19:39:21,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:21,388 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 19:39:21,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:21,489 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 19:39:21,564 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 19:39:21,568 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 19:39:21,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:21,591 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 19:39:21,591 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 19:39:21,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3766) |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 19:39:21,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3766 (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_3766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 19:39:22,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3766 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3812)) (.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_3766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 19:39:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926986193] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:22,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:39:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 27 [2023-12-02 19:39:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953211196] [2023-12-02 19:39:22,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:39:22,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:39:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:39:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:39:22,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=764, Unknown=9, NotChecked=366, Total=1260 [2023-12-02 19:39:22,033 INFO L87 Difference]: Start difference. First operand 544 states and 600 transitions. Second operand has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 28 states have internal predecessors, (136), 3 states have call successors, (3), 2 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 19:39:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:32,009 INFO L93 Difference]: Finished difference Result 1003 states and 1114 transitions. [2023-12-02 19:39:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 19:39:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 28 states have internal predecessors, (136), 3 states have call successors, (3), 2 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 105 [2023-12-02 19:39:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:32,013 INFO L225 Difference]: With dead ends: 1003 [2023-12-02 19:39:32,013 INFO L226 Difference]: Without dead ends: 1003 [2023-12-02 19:39:32,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=262, Invalid=1645, Unknown=9, NotChecked=534, Total=2450 [2023-12-02 19:39:32,014 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 1312 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 5153 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 5153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:32,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 3635 Invalid, 5240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 5153 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-12-02 19:39:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-12-02 19:39:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 543. [2023-12-02 19:39:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 351 states have (on average 1.6296296296296295) internal successors, (572), 536 states have internal predecessors, (572), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:39:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 599 transitions. [2023-12-02 19:39:32,027 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 599 transitions. Word has length 105 [2023-12-02 19:39:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:32,027 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 599 transitions. [2023-12-02 19:39:32,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 28 states have internal predecessors, (136), 3 states have call successors, (3), 2 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 19:39:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 599 transitions. [2023-12-02 19:39:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 19:39:32,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:32,029 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 19:39:32,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 19:39:32,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Ended with exit code 0 [2023-12-02 19:39:32,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 19:39:32,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:32,630 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:39:32,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -803709861, now seen corresponding path program 1 times [2023-12-02 19:39:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:39:32,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820077486] [2023-12-02 19:39:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:32,630 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 19:39:32,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:39:32,631 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:39:32,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 19:39:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:33,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 19:39:33,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:33,390 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 19:39:33,499 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:39:33,500 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 19:39:33,505 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 19:39:33,526 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 19:39:33,540 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 19:39:33,630 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 19:39:33,634 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 19:39:34,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:34,299 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 19:39:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:39:34,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:39:34,428 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 19:39:34,440 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 19:39:34,451 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 19:39:34,458 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 19:39:34,487 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 19:39:34,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:34,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-12-02 19:39:34,676 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_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:39:35,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4356))) (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_4357) .cse0 v_ArrVal_4264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4264 (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_4357) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4264) |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 19:39:35,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:39:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820077486] [2023-12-02 19:39:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820077486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059857407] [2023-12-02 19:39:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:39:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:39:35,981 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:39:35,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 19:41:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:41:28,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 19:41:28,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:41:28,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:41:28,691 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:41:28,691 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 19:41:28,701 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 19:41:28,750 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 19:41:28,762 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 19:41:28,904 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 19:41:28,908 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 19:41:29,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:41:29,552 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 19:41:29,560 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 19:41:29,705 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:41:29,705 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 19:41:29,710 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 19:41:29,731 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 19:41:29,737 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 19:41:29,739 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 19:41:29,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:41:29,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-12-02 19:41:29,823 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_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:41:31,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4901))) (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_4902) .cse0 v_ArrVal_4809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (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_4902) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4809) |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 19:41:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059857407] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:41:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27996849] [2023-12-02 19:41:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:41:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:41:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:41:31,124 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:41:31,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 19:41:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:41:31,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 19:41:31,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:41:31,672 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 19:41:31,778 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:41:31,778 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 19:41:31,783 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 19:41:31,793 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 19:41:31,803 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 19:41:31,848 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 19:41:31,852 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 19:41:32,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:41:32,530 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 19:41:32,540 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 19:41:32,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:41:32,626 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 19:41:32,633 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 19:41:32,653 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 19:41:32,661 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 19:41:32,665 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 19:41:32,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:41:32,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5355) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:41:32,768 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_5355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5355) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 19:41:33,955 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5447))) (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_5446) .cse0 v_ArrVal_5354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5355) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5354 (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_5446) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5354) |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 19:41:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27996849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:41:33,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:41:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 19:41:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604667284] [2023-12-02 19:41:33,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:41:33,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:41:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:41:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:41:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 19:41:33,967 INFO L87 Difference]: Start difference. First operand 543 states and 599 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 19:41:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:41:39,657 INFO L93 Difference]: Finished difference Result 552 states and 609 transitions. [2023-12-02 19:41:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:41:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 105 [2023-12-02 19:41:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:41:39,661 INFO L225 Difference]: With dead ends: 552 [2023-12-02 19:41:39,661 INFO L226 Difference]: Without dead ends: 552 [2023-12-02 19:41:39,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 301 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 19:41:39,663 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 654 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:41:39,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1006 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-02 19:41:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-02 19:41:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 542. [2023-12-02 19:41:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 351 states have (on average 1.6267806267806268) internal successors, (571), 535 states have internal predecessors, (571), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:41:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 598 transitions. [2023-12-02 19:41:39,674 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 598 transitions. Word has length 105 [2023-12-02 19:41:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:41:39,675 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 598 transitions. [2023-12-02 19:41:39,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 19:41:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 598 transitions. [2023-12-02 19:41:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 19:41:39,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:41:39,676 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 19:41:39,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-02 19:41:39,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 19:41:40,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 19:41:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:41:40,277 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:41:40,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:41:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 729709945, now seen corresponding path program 1 times [2023-12-02 19:41:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:41:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695966005] [2023-12-02 19:41:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:41:40,278 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 19:41:40,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:41:40,294 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:41:40,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-02 19:41:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:41:41,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 19:41:41,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:41:41,228 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 19:41:41,362 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:41:41,362 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 19:41:41,404 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 19:41:41,493 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 19:41:42,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:41:42,391 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 19:41:42,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:41:42,499 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 19:41:42,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:41:42,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 19:41:42,606 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 19:41:42,644 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 19:41:42,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:41:42,704 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5869 (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_5869) |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 19:41:42,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5869 (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_5869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:41:42,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5868 (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~mem35#1.base| v_ArrVal_5868))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:41:42,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5868 (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_5868))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:41:43,123 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5868 (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_5915))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5868)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5869)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:41:43,127 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:41:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695966005] [2023-12-02 19:41:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695966005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:41:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297567389] [2023-12-02 19:41:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:41:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:41:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:41:43,128 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:41:43,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 19:42:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:42:05,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 19:42:05,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:42:05,800 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 19:42:05,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 19:42:06,192 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-02 19:42:06,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:42:06,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:42:06,843 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:42:06,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:42:06,985 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:42:06,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:42:07,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:42:07,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:42:07,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 35 treesize of output 19 [2023-12-02 19:42:07,150 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 19:42:07,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:42:07,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6336) |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 19:42:07,175 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (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_6336) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:42:07,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6336 (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~mem35#1.base| v_ArrVal_6335))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6336)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:42:08,236 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-12-02 19:42:08,236 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 61 treesize of output 60 [2023-12-02 19:42:08,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_6382))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6335)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6336)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 19:42:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1297567389] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:42:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812966556] [2023-12-02 19:42:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:42:08,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:42:08,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:42:08,252 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:42:08,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 19:42:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:42:08,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 19:42:08,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:42:08,833 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 19:42:08,934 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:42:08,934 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 19:42:08,979 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 19:42:09,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:09,480 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 19:42:09,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:09,679 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 19:42:09,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:09,766 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 19:42:09,775 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 19:42:09,778 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 19:42:09,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:42:09,791 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6803) |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 19:42:09,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6803 (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_6803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:42:09,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6803 (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_6802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:42:09,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6803 (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_6802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:42:10,263 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-12-02 19:42:10,263 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 61 treesize of output 60 [2023-12-02 19:42:10,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (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_6849))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 19:42:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812966556] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:42:10,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:42:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2023-12-02 19:42:10,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880073748] [2023-12-02 19:42:10,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:42:10,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 19:42:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:42:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 19:42:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=864, Unknown=23, NotChecked=1022, Total=2070 [2023-12-02 19:42:10,283 INFO L87 Difference]: Start difference. First operand 542 states and 598 transitions. Second operand has 30 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 29 states have internal predecessors, (138), 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 19:42:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:42:19,187 INFO L93 Difference]: Finished difference Result 999 states and 1110 transitions. [2023-12-02 19:42:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 19:42:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 29 states have internal predecessors, (138), 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 107 [2023-12-02 19:42:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:42:19,191 INFO L225 Difference]: With dead ends: 999 [2023-12-02 19:42:19,191 INFO L226 Difference]: Without dead ends: 999 [2023-12-02 19:42:19,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=316, Invalid=1878, Unknown=24, NotChecked=1442, Total=3660 [2023-12-02 19:42:19,193 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 1022 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 3843 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:42:19,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2655 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3843 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-12-02 19:42:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-12-02 19:42:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 541. [2023-12-02 19:42:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 351 states have (on average 1.623931623931624) internal successors, (570), 534 states have internal predecessors, (570), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:42:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 597 transitions. [2023-12-02 19:42:19,203 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 597 transitions. Word has length 107 [2023-12-02 19:42:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:42:19,204 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 597 transitions. [2023-12-02 19:42:19,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 29 states have internal predecessors, (138), 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 19:42:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 597 transitions. [2023-12-02 19:42:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 19:42:19,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:42:19,205 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 19:42:19,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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)] Forceful destruction successful, exit code 0 [2023-12-02 19:42:19,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 19:42:19,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 19:42:19,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:42:19,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:42:19,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:42:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 729709946, now seen corresponding path program 1 times [2023-12-02 19:42:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:42:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773476417] [2023-12-02 19:42:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:42:19,808 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 19:42:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:42:19,809 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:42:19,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-02 19:42:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:42:20,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 19:42:20,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:42:20,709 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 19:42:20,801 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 19:42:20,817 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:42:20,817 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 19:42:20,840 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 19:42:20,848 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 19:42:20,940 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 19:42:20,944 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 19:42:21,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:21,570 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 19:42:21,580 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 19:42:21,679 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:21,679 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 19:42:21,691 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 19:42:21,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:42:21,776 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 19:42:21,782 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 19:42:21,801 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 19:42:21,806 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 19:42:21,838 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 19:42:21,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:42:21,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7319) |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_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:42:22,029 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_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 19:42:22,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7317))) (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_7316) .cse0 v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (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_7316) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7319) |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 19:42:22,122 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_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7317))) (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_7316) .cse1 v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7316) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7319) |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 19:42:23,414 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7411 (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_7411))) (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_7410) .cse1 v_ArrVal_7316) (select (select (store .cse2 .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7319))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7411))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7317))) (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_7410) .cse4 v_ArrVal_7316) .cse5 v_ArrVal_7319) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:42:23,427 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:42:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773476417] [2023-12-02 19:42:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773476417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:42:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425157476] [2023-12-02 19:42:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:42:23,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:42:23,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:42:23,428 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:42:23,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 19:43:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:23,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 19:43:23,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:23,056 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 19:43:23,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:43:23,345 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 19:43:23,351 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 19:43:23,407 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 19:43:23,413 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 19:43:23,551 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 19:43:23,554 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 19:43:24,115 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:43:24,115 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 19:43:24,120 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 19:43:24,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:43:24,286 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 19:43:24,291 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 19:43:24,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:43:24,397 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 19:43:24,406 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 19:43:24,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:43:24,421 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 19:43:24,426 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 19:43:24,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:43:24,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7881) |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_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 19:43:24,515 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_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 19:43:24,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7879))) (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_7878) .cse0 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (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_7878) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7881) |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 19:43:24,708 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_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7878) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7879))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7878) .cse3 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:43:26,137 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7972))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7879))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7973) .cse0 v_ArrVal_7878) .cse1 v_ArrVal_7881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7972))) (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_7973) .cse6 v_ArrVal_7878) (select (select (store .cse7 .cse6 v_ArrVal_7879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 19:43:26,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [425157476] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:43:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313339663] [2023-12-02 19:43:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:26,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:43:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:43:26,150 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:43:26,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 19:43:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:26,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 19:43:26,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:26,802 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 19:43:26,911 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 19:43:26,927 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:43:26,928 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 19:43:26,939 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 19:43:26,956 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 19:43:27,020 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 19:43:27,025 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 19:43:27,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:27,666 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 19:43:27,676 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 19:43:27,742 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:27,742 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 19:43:27,756 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 19:43:27,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:27,796 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 19:43:27,808 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 19:43:27,819 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 19:43:27,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:43:27,829 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 19:43:27,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:43:27,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8443) |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_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:43:27,912 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_8443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 19:43:27,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8441))) (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_8440) .cse0 v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (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_8440) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8443) |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 19:43:28,083 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_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8440) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8441))) (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_8440) .cse3 v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:43:29,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8535))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8441))) (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_8534) .cse0 v_ArrVal_8440) .cse1 v_ArrVal_8443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8443 (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_8535))) (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_8534) .cse6 v_ArrVal_8440) (select (select (store .cse7 .cse6 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8443))) |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 19:43:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313339663] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:43:29,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:43:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 19:43:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594966849] [2023-12-02 19:43:29,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:43:29,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 19:43:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:43:29,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 19:43:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 19:43:29,590 INFO L87 Difference]: Start difference. First operand 541 states and 597 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 19:43:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:43:37,657 INFO L93 Difference]: Finished difference Result 550 states and 607 transitions. [2023-12-02 19:43:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:43:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 19:43:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:43:37,660 INFO L225 Difference]: With dead ends: 550 [2023-12-02 19:43:37,660 INFO L226 Difference]: Without dead ends: 550 [2023-12-02 19:43:37,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 305 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 19:43:37,661 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 358 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:43:37,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1026 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-12-02 19:43:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-12-02 19:43:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 540. [2023-12-02 19:43:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 351 states have (on average 1.621082621082621) internal successors, (569), 533 states have internal predecessors, (569), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:43:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 596 transitions. [2023-12-02 19:43:37,672 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 596 transitions. Word has length 107 [2023-12-02 19:43:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:43:37,672 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 596 transitions. [2023-12-02 19:43:37,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 19:43:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 596 transitions. [2023-12-02 19:43:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 19:43:37,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:43:37,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, 1, 1, 1, 1] [2023-12-02 19:43:37,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-02 19:43:37,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-12-02 19:43:38,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 19:43:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:43:38,274 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:43:38,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:43:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1172356402, now seen corresponding path program 1 times [2023-12-02 19:43:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:43:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498166879] [2023-12-02 19:43:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:38,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 19:43:38,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:43:38,276 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:43:38,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-02 19:43:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:39,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 19:43:39,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:39,496 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 19:43:39,705 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:43:39,705 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 19:43:39,744 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 19:43:39,878 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 19:43:41,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:41,053 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 19:43:41,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:41,183 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 19:43:41,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:41,298 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 19:43:41,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:43:41,420 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 19:43:41,437 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 19:43:41,493 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 19:43:41,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:43:41,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (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_8973) |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 19:43:41,598 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 19:43:41,616 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (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_8972))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:43:41,635 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (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_8972))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:43:41,655 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (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_8971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:43:41,678 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:43:42,134 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9019 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9019))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8971)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:43:42,139 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:43:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498166879] [2023-12-02 19:43:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498166879] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:43:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1774430469] [2023-12-02 19:43:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:43:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:43:42,140 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:43:42,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 19:45:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:02,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 19:45:02,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:02,152 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 19:45:02,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 19:45:02,886 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-02 19:45:02,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:45:02,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:45:04,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:04,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:45:04,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:04,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:45:04,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:04,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:45:04,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:04,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:45:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 19:45:04,780 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 19:45:04,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:04,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 19:45:05,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9455 (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_9455))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9456)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:45:05,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9454 (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_9454))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9455)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9456)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:45:05,269 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9454 (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_9454))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9455)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9456)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:45:05,841 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 19:45:05,841 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 19:45:05,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (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_9502))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9454)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9455)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9456)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 19:45:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1774430469] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607364111] [2023-12-02 19:45:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:05,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:05,867 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:05,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 19:45:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:06,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 19:45:06,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:06,557 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 19:45:06,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:45:06,756 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 19:45:06,845 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 19:45:07,710 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:45:07,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 19:45:08,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:45:08,002 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 19:45:08,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:45:08,176 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 19:45:08,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:45:08,327 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 19:45:08,340 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 19:45:08,345 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 19:45:08,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:08,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9939) |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 19:45:08,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (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_9939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:45:08,398 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9938 (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_9938))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9939)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:45:08,415 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9938 (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_9938))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9939)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:45:08,435 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9937 (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_9937))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9938)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9939)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:45:08,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9937 (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_9937))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9938)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9939)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:45:08,949 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 19:45:08,949 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 19:45:08,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (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_9985))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9937)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9938)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9939)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 19:45:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607364111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:08,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:08,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2023-12-02 19:45:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068479789] [2023-12-02 19:45:08,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:45:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:45:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:45:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1109, Unknown=36, NotChecked=1634, Total=2970 [2023-12-02 19:45:08,974 INFO L87 Difference]: Start difference. First operand 540 states and 596 transitions. Second operand has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 32 states have internal predecessors, (144), 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 19:45:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:23,490 INFO L93 Difference]: Finished difference Result 995 states and 1106 transitions. [2023-12-02 19:45:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 19:45:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 32 states have internal predecessors, (144), 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 19:45:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:23,496 INFO L225 Difference]: With dead ends: 995 [2023-12-02 19:45:23,496 INFO L226 Difference]: Without dead ends: 995 [2023-12-02 19:45:23,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=358, Invalid=2334, Unknown=36, NotChecked=2242, Total=4970 [2023-12-02 19:45:23,499 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 1284 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3024 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:23,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 3024 Invalid, 4415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2023-12-02 19:45:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-12-02 19:45:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 539. [2023-12-02 19:45:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 351 states have (on average 1.6182336182336183) internal successors, (568), 532 states have internal predecessors, (568), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:45:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 595 transitions. [2023-12-02 19:45:23,510 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 595 transitions. Word has length 109 [2023-12-02 19:45:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:23,510 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 595 transitions. [2023-12-02 19:45:23,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 32 states have internal predecessors, (144), 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 19:45:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 595 transitions. [2023-12-02 19:45:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 19:45:23,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:23,512 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 19:45:23,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 19:45:23,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 19:45:23,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-12-02 19:45:24,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:45:24,113 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:45:24,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1172356403, now seen corresponding path program 1 times [2023-12-02 19:45:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:45:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861621417] [2023-12-02 19:45:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:24,114 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 19:45:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:45:24,115 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:45:24,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-02 19:45:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:25,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 19:45:25,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:25,258 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 19:45:25,707 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:45:25,707 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 19:45:25,723 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 19:45:25,771 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 19:45:25,792 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 19:45:25,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:45:25,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 19:45:27,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:27,028 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 19:45:27,044 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 19:45:27,217 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:27,217 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 19:45:27,231 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 19:45:27,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:27,349 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 19:45:27,356 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 19:45:27,497 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:45:27,497 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 19:45:27,504 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 19:45:27,533 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 19:45:27,544 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 19:45:27,594 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 19:45:27,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:27,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:45:27,858 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_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:45:28,016 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (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_10470) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10469))) (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_10470) .cse2 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 19:45:28,107 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_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10469))) (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_10470) .cse1 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10470) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10471) |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 19:45:30,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10467))) (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~mem35#1.base| v_ArrVal_10468) .cse1 v_ArrVal_10470) (select (select (store .cse2 .cse1 v_ArrVal_10469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10471))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10467))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10469))) (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~mem35#1.base| v_ArrVal_10468) .cse4 v_ArrVal_10470) .cse5 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:45:30,697 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_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10467))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10469))) (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_10468) .cse1 v_ArrVal_10470) .cse2 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10467))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10468) .cse7 v_ArrVal_10470) (select (select (store .cse8 .cse7 v_ArrVal_10469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10471))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 19:45:34,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10564))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10467))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10563) .cse1 v_ArrVal_10468) .cse2 v_ArrVal_10470) (select (select (store .cse3 .cse2 v_ArrVal_10469) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10471))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10469 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10564))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10467))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10469))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10563) .cse6 v_ArrVal_10468) .cse7 v_ArrVal_10470) .cse8 v_ArrVal_10471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 19:45:34,719 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:45:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861621417] [2023-12-02 19:45:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861621417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [15374017] [2023-12-02 19:45:34,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:45:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:45:34,721 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:45:34,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2023-12-02 19:46:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:44,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 120 conjunts are in the unsatisfiable core [2023-12-02 19:46:44,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:44,423 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 19:46:46,121 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 19:46:46,245 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:46:46,245 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 19:46:46,307 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 19:46:46,383 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 19:46:46,678 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 19:46:46,699 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 19:46:50,509 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:46:50,510 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 19:46:50,532 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 19:46:50,966 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:46:50,966 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 19:46:50,987 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 19:46:51,277 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:46:51,277 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 19:46:51,335 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 19:46:51,567 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:46:51,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:46:51,625 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 19:46:51,686 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 19:46:51,724 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 19:46:51,744 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 19:46:51,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:51,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 19:46:52,011 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_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:46:52,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (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_11048) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11049))) (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_11048) .cse2 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 19:46:52,355 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_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11048) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11049))) (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_11048) .cse3 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:46:52,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_11046))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11049))) (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_11047) .cse0 v_ArrVal_11048) .cse1 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (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_11046))) (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_11047) .cse6 v_ArrVal_11048) (select (select (store .cse7 .cse6 v_ArrVal_11049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11050))) |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 19:47:08,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_11142))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11046))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_11143) .cse1 v_ArrVal_11047) .cse2 v_ArrVal_11048) (select (select (store .cse3 .cse2 v_ArrVal_11049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11050))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_11142))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11046))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11049))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_11143) .cse6 v_ArrVal_11047) .cse7 v_ArrVal_11048) .cse8 v_ArrVal_11050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_11051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 19:47:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [15374017] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725620803] [2023-12-02 19:47:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:08,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:08,415 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:08,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-12-02 19:47:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:09,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 19:47:09,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:09,215 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 19:47:10,811 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 19:47:10,963 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:47:10,963 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 19:47:11,415 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 19:47:11,530 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 19:47:12,631 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 19:47:12,660 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 19:47:18,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:47:18,155 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 19:47:18,186 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 19:47:19,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:47:19,336 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 19:47:19,423 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 19:47:20,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:47:20,182 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 19:47:20,269 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 19:47:21,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:47:21,045 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 19:47:21,103 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 19:47:21,200 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 19:47:21,263 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 19:47:21,294 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 19:47:21,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:21,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 19:47:21,678 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_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:47:21,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11627))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11628) .cse0 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11628) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 19:47:22,043 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_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11627))) (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_11628) .cse1 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11628) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11629) |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 19:47:23,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_11625))) (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~mem35#1.base| v_ArrVal_11626) .cse1 v_ArrVal_11628) (select (select (store .cse2 .cse1 v_ArrVal_11627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11629))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_11625))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11627))) (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~mem35#1.base| v_ArrVal_11626) .cse4 v_ArrVal_11628) .cse5 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:47:24,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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|) .cse4))) (and (forall ((v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11625))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11626) .cse2 v_ArrVal_11628) (select (select (store .cse3 .cse2 v_ArrVal_11627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11629))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11625))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11627))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11626) .cse5 v_ArrVal_11628) .cse6 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 19:47:30,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_11721))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11625))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11627))) (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_11722) .cse0 v_ArrVal_11626) .cse1 v_ArrVal_11628) .cse2 v_ArrVal_11629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11627 (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_11721))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11625))) (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_11722) .cse8 v_ArrVal_11626) .cse9 v_ArrVal_11628) (select (select (store .cse10 .cse9 v_ArrVal_11627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11629))))) |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 19:47:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725620803] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:30,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-12-02 19:47:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288771001] [2023-12-02 19:47:30,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:30,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 19:47:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:47:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 19:47:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=394, Unknown=26, NotChecked=1180, Total=1722 [2023-12-02 19:47:30,859 INFO L87 Difference]: Start difference. First operand 539 states and 595 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 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 19:48:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:15,360 INFO L93 Difference]: Finished difference Result 548 states and 605 transitions. [2023-12-02 19:48:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:48:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 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 109 [2023-12-02 19:48:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:15,364 INFO L225 Difference]: With dead ends: 548 [2023-12-02 19:48:15,364 INFO L226 Difference]: Without dead ends: 548 [2023-12-02 19:48:15,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 309 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=191, Invalid=675, Unknown=26, NotChecked=1460, Total=2352 [2023-12-02 19:48:15,365 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 356 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:15,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1142 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 41.8s Time] [2023-12-02 19:48:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-12-02 19:48:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 538. [2023-12-02 19:48:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 351 states have (on average 1.6153846153846154) internal successors, (567), 531 states have internal predecessors, (567), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:48:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 594 transitions. [2023-12-02 19:48:15,375 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 594 transitions. Word has length 109 [2023-12-02 19:48:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:15,375 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 594 transitions. [2023-12-02 19:48:15,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 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 19:48:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 594 transitions. [2023-12-02 19:48:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-02 19:48:15,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:15,376 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:15,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-02 19:48:15,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2023-12-02 19:48:15,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-12-02 19:48:15,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:15,977 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:48:15,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1353857945, now seen corresponding path program 1 times [2023-12-02 19:48:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:48:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296820509] [2023-12-02 19:48:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:15,978 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 19:48:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:48:15,979 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:48:15,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-02 19:48:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:17,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 19:48:17,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:17,564 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 19:48:19,199 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:48:19,199 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 19:48:19,528 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 19:48:20,227 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 19:48:27,025 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:48:27,026 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 19:48:27,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:48:27,848 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 19:48:28,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:48:28,519 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 19:48:29,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:48:29,271 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 19:48:30,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:48:30,037 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 19:48:30,132 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 19:48:30,469 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-12-02 19:48:30,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-12-02 19:48:30,908 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 19:48:30,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:31,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12178) |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 19:48:31,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_12178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:48:31,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12177))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:48:32,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:48:32,117 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12176 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12176))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:48:32,207 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12176 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12176))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:48:32,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12176 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_12175))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12176)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:48:32,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12176 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12175))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12176)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:48:34,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12225 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_12225))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12175)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12176)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:48:34,358 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:48:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296820509] [2023-12-02 19:48:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296820509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557291273] [2023-12-02 19:48:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:48:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:48:34,360 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:48:34,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-12-02 19:48:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:58,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 19:48:58,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:59,415 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 19:48:59,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 19:49:03,984 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-02 19:49:03,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:49:04,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:49:10,617 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:49:10,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:49:12,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:49:12,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:49:13,288 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:49:13,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:49:14,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:49:14,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:49:15,451 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:49:15,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:49:15,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 19:49:15,936 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 19:49:15,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 19:49:16,532 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 19:49:16,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:17,164 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12680) |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 19:49:17,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_12680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 19:49:17,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12679))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:49:17,397 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:49:17,480 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12678 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12678))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:49:17,564 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12678 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12678))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:49:17,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12677 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_12677))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12678)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:49:17,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12677 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12677))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12678)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:49:19,863 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2023-12-02 19:49:19,864 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 591 treesize of output 590 [2023-12-02 19:49:19,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12677 (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 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_12727))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12677)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12678)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12679)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12680)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 19:49:19,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [557291273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:19,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807744891] [2023-12-02 19:49:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:19,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:49:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:49:19,965 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:49:19,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-12-02 19:49:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:20,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 19:49:20,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:49:20,841 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 19:49:22,268 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:49:22,268 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 19:49:22,842 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 19:49:27,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:49:27,407 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 19:49:28,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:49:28,857 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 19:49:29,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:49:29,783 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 19:49:30,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:49:30,712 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 19:49:31,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:49:31,677 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 19:49:31,771 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 19:49:32,074 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 19:49:32,075 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 21 treesize of output 20 [2023-12-02 19:49:32,104 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 19:49:32,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:35,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_13182) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (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_13182) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,443 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_13181))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (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_13181))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,668 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13180))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13181)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,782 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (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_13180))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13181)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:35,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13179 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (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~mem35#1.base| v_ArrVal_13179))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13180)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13181)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-12-02 19:49:36,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13183 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_13180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13179 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_13183) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13179))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13180)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13181)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) is different from false [2023-12-02 19:49:38,464 INFO L349 Elim1Store]: treesize reduction 207, result has 49.4 percent of original size [2023-12-02 19:49:38,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 603 treesize of output 609 [2023-12-02 19:49:38,549 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13229 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13179 (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 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_13229))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13179)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13180)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13181)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13182)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 19:49:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807744891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:38,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:49:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2023-12-02 19:49:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917261360] [2023-12-02 19:49:38,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:49:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 19:49:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:49:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 19:49:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1250, Unknown=28, NotChecked=2646, Total=4160 [2023-12-02 19:49:38,571 INFO L87 Difference]: Start difference. First operand 538 states and 594 transitions. Second operand has 36 states, 32 states have (on average 4.6875) internal successors, (150), 35 states have internal predecessors, (150), 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 19:50:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:50:44,397 INFO L93 Difference]: Finished difference Result 991 states and 1102 transitions. [2023-12-02 19:50:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 19:50:44,398 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 4.6875) internal successors, (150), 35 states have internal predecessors, (150), 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 111 [2023-12-02 19:50:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:50:44,403 INFO L225 Difference]: With dead ends: 991 [2023-12-02 19:50:44,403 INFO L226 Difference]: Without dead ends: 991 [2023-12-02 19:50:44,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=425, Invalid=2625, Unknown=28, NotChecked=3564, Total=6642 [2023-12-02 19:50:44,405 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 1276 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:50:44,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2493 Invalid, 3717 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 58.2s Time] [2023-12-02 19:50:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2023-12-02 19:50:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 537. [2023-12-02 19:50:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 351 states have (on average 1.6125356125356125) internal successors, (566), 530 states have internal predecessors, (566), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2023-12-02 19:50:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 593 transitions. [2023-12-02 19:50:44,425 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 593 transitions. Word has length 111 [2023-12-02 19:50:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:50:44,425 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 593 transitions. [2023-12-02 19:50:44,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 4.6875) internal successors, (150), 35 states have internal predecessors, (150), 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 19:50:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 593 transitions. [2023-12-02 19:50:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-02 19:50:44,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:50:44,427 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:50:44,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-12-02 19:50:44,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2023-12-02 19:50:44,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2023-12-02 19:50:45,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:50:45,031 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 19:50:45,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:50:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1353857946, now seen corresponding path program 1 times [2023-12-02 19:50:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:50:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768241587] [2023-12-02 19:50:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:50:45,032 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 19:50:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:50:45,033 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 19:50:45,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/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 (49)] Waiting until timeout for monitored process [2023-12-02 19:50:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:50:46,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 19:50:46,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:50:46,622 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 19:50:48,337 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:50:48,337 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 19:50:48,452 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 19:50:48,700 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 19:50:48,828 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 19:50:50,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-12-02 19:50:50,055 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 19:51:01,763 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:51:01,763 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 75 treesize of output 68 [2023-12-02 19:51:01,895 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 19:51:02,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:51:02,979 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 75 treesize of output 68 [2023-12-02 19:51:03,016 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 19:51:04,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:51:04,059 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 75 treesize of output 68 [2023-12-02 19:51:04,194 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 19:51:05,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:51:05,161 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 75 treesize of output 68 [2023-12-02 19:51:05,202 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 19:51:06,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:51:06,176 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 75 treesize of output 68 [2023-12-02 19:51:06,210 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 19:51:06,377 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 44 treesize of output 20 [2023-12-02 19:51:06,414 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 19:51:06,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:51:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 19:51:06,751 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-02 19:51:06,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:51:07,077 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 19:51:07,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:13,691 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_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))) (forall ((v_ArrVal_13737 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (or (forall ((v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))))))) is different from false [2023-12-02 19:51:13,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_13734) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_13733))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_13734) .cse2 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse3 .cse2 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))))) is different from false [2023-12-02 19:51:14,116 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_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13733))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13734) .cse1 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse3 .cse1 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))) (forall ((v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13734) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-12-02 19:51:14,351 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))) (forall ((v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13732))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13731) .cse1 v_ArrVal_13734) (select (select (store .cse2 .cse1 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_13735))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13732))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_13733))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13731) .cse4 v_ArrVal_13734) .cse5 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse6 .cse5 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))))) is different from false [2023-12-02 19:51:14,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))) (forall ((v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13732))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13731) .cse2 v_ArrVal_13734) (select (select (store .cse3 .cse2 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_13735))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13732))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_13733))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13731) .cse5 v_ArrVal_13734) .cse6 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse7 .cse6 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))))))) is different from false [2023-12-02 19:51:14,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_13729))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_13732))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_13733))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_13730) .cse0 v_ArrVal_13731) .cse1 v_ArrVal_13734) .cse2 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse4 .cse2 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))) (forall ((v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_13729))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_13732))) (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~mem35#1.base| v_ArrVal_13730) .cse8 v_ArrVal_13731) .cse9 v_ArrVal_13734) (select (select (store .cse10 .cse9 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_13735))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-12-02 19:51:15,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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|) .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13729))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_13732))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_13733))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13730) .cse1 v_ArrVal_13731) .cse2 v_ArrVal_13734) .cse3 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse5 .cse3 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))) (or (forall ((v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13729))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_13732))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13730) .cse9 v_ArrVal_13731) .cse10 v_ArrVal_13734) (select (select (store .cse11 .cse10 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_13735))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))))))) is different from false [2023-12-02 19:51:19,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|)))) (forall ((v_ArrVal_13829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_13828))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_13729))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_13732))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_13829) .cse1 v_ArrVal_13730) .cse2 v_ArrVal_13731) .cse3 v_ArrVal_13734) (select (select (store .cse4 .cse3 v_ArrVal_13733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_13735))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_19| (_ BitVec 32)) (v_ArrVal_13829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_13737 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_13828))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_13729))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_13732))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_13733))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_13829) .cse8 v_ArrVal_13730) .cse9 v_ArrVal_13731) .cse10 v_ArrVal_13734) .cse11 v_ArrVal_13735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_19| v_ArrVal_13737) (select (select (store .cse12 .cse11 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_19|))))))) is different from false [2023-12-02 19:51:19,955 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:51:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768241587] [2023-12-02 19:51:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768241587] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1425241678] [2023-12-02 19:51:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:51:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:51:19,956 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:51:19,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9124f40-4a97-40a2-94ba-444fe0ab4260/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process