./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E --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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:18:21,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:18:21,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:18:21,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:18:21,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:18:21,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:18:21,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:18:21,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:18:21,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:18:21,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:18:21,286 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:18:21,286 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:18:21,287 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:18:21,288 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:18:21,288 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:18:21,288 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:18:21,288 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:18:21,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:18:21,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:18:21,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:18:21,290 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:18:21,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:18:21,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:18:21,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:18:21,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:18:21,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:18:21,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:18:21,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:18:21,292 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:18:21,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:18:21,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:18:21,293 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:18:21,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:18:21,293 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-11-14 03:18:21,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:18:21,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:18:21,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:18:21,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:18:21,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:18:21,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i Unable to find full path for "g++" [2024-11-14 03:18:24,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:18:24,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:18:24,542 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-11-14 03:18:24,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/78133066e/d9eb3b7bb1244d789d562b407e8901e8/FLAGc6ac5f978 [2024-11-14 03:18:24,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/78133066e/d9eb3b7bb1244d789d562b407e8901e8 [2024-11-14 03:18:24,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:18:24,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:18:24,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:18:24,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:18:24,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:18:24,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:18:24" (1/1) ... [2024-11-14 03:18:24,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1612e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:24, skipping insertion in model container [2024-11-14 03:18:24,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:18:24" (1/1) ... [2024-11-14 03:18:24,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:18:25,394 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,465 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,470 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,476 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,486 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,537 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,540 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,541 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,545 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,547 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,549 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,550 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,556 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,564 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,570 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:25,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:18:25,604 ERROR L321 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) [2024-11-14 03:18:25,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fb0951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:25, skipping insertion in model container [2024-11-14 03:18:25,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:18:25,605 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-14 03:18:25,608 INFO L158 Benchmark]: Toolchain (without parser) took 1020.01ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 69.2MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:18:25,609 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 83.9MB. Free memory was 40.7MB in the beginning and 40.5MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:18:25,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1013.59ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 69.2MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:18:25,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 83.9MB. Free memory was 40.7MB in the beginning and 40.5MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1013.59ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 69.2MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E --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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:18:28,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:18:28,843 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:18:28,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:18:28,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:18:28,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:18:28,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:18:28,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:18:28,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:18:28,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:18:28,895 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:18:28,895 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:18:28,896 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:18:28,896 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:18:28,896 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:18:28,896 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:18:28,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:18:28,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:18:28,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:18:28,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:18:28,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:18:28,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:18:28,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:18:28,897 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:18:28,899 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:18:28,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:18:28,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:18:28,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:18:28,901 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:18:28,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-11-14 03:18:29,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:18:29,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:18:29,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:18:29,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:18:29,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:18:29,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i Unable to find full path for "g++" [2024-11-14 03:18:31,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:18:32,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:18:32,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-11-14 03:18:32,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/50960a4e3/ac8a4dd13524495eb1cfaace9ee88ff3/FLAG300b409fb [2024-11-14 03:18:32,485 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/data/50960a4e3/ac8a4dd13524495eb1cfaace9ee88ff3 [2024-11-14 03:18:32,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:18:32,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:18:32,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:18:32,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:18:32,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:18:32,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:18:32" (1/1) ... [2024-11-14 03:18:32,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b5a94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:32, skipping insertion in model container [2024-11-14 03:18:32,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:18:32" (1/1) ... [2024-11-14 03:18:32,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:18:33,271 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,350 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,363 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,371 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,382 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,435 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,435 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,439 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,440 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,452 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,454 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,456 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,457 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,467 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,474 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,477 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,479 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,483 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:18:33,535 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-14 03:18:33,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:18:33,636 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,660 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,663 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,668 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,675 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,709 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,710 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,713 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,714 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,721 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,722 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,724 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,725 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,731 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,733 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,737 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,738 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,746 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:18:33,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:18:33,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:18:33,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:18:34,044 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:18:34,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34 WrapperNode [2024-11-14 03:18:34,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:18:34,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:18:34,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:18:34,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:18:34,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,180 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1165 [2024-11-14 03:18:34,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:18:34,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:18:34,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:18:34,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:18:34,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:18:34,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:18:34,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:18:34,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:18:34,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (1/1) ... [2024-11-14 03:18:34,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:18:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:34,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:18:34,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:18:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 03:18:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 03:18:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 03:18:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:18:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 03:18:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 03:18:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 03:18:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-14 03:18:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:18:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:18:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:18:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:18:34,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:18:34,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:18:34,829 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 03:18:41,999 INFO L? ?]: Removed 1315 outVars from TransFormulas that were not future-live. [2024-11-14 03:18:41,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:18:42,060 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:18:42,060 INFO L316 CfgBuilder]: Removed 71 assume(true) statements. [2024-11-14 03:18:42,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:18:42 BoogieIcfgContainer [2024-11-14 03:18:42,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:18:42,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:18:42,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:18:42,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:18:42,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:18:32" (1/3) ... [2024-11-14 03:18:42,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1921d73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:18:42, skipping insertion in model container [2024-11-14 03:18:42,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:18:34" (2/3) ... [2024-11-14 03:18:42,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1921d73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:18:42, skipping insertion in model container [2024-11-14 03:18:42,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:18:42" (3/3) ... [2024-11-14 03:18:42,073 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-2.i [2024-11-14 03:18:42,092 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:18:42,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test8-2.i that has 5 procedures, 1299 locations, 1 initial locations, 40 loop locations, and 634 error locations. [2024-11-14 03:18:42,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:18:42,197 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@55b6cb9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:18:42,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2024-11-14 03:18:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 1299 states, 641 states have (on average 2.2293291731669265) internal successors, (1429), 1289 states have internal predecessors, (1429), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:18:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:18:42,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:42,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:18:42,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:18:42,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 141073, now seen corresponding path program 1 times [2024-11-14 03:18:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:18:42,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660035250] [2024-11-14 03:18:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:18:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:18:42,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:18:42,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:18:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:42,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:18:42,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:42,542 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 [2024-11-14 03:18:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:18:42,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:18:42,573 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:18:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660035250] [2024-11-14 03:18:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660035250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:18:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411000324] [2024-11-14 03:18:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:42,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:18:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:18:42,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:18:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:18:42,618 INFO L87 Difference]: Start difference. First operand has 1299 states, 641 states have (on average 2.2293291731669265) internal successors, (1429), 1289 states have internal predecessors, (1429), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:46,081 INFO L93 Difference]: Finished difference Result 1481 states and 1588 transitions. [2024-11-14 03:18:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:18:46,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:18:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:46,117 INFO L225 Difference]: With dead ends: 1481 [2024-11-14 03:18:46,117 INFO L226 Difference]: Without dead ends: 1479 [2024-11-14 03:18:46,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:18:46,163 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 1153 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:46,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1060 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:18:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-11-14 03:18:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1288. [2024-11-14 03:18:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 646 states have (on average 2.08359133126935) internal successors, (1346), 1277 states have internal predecessors, (1346), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-14 03:18:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1390 transitions. [2024-11-14 03:18:46,342 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1390 transitions. Word has length 3 [2024-11-14 03:18:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:46,345 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1390 transitions. [2024-11-14 03:18:46,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1390 transitions. [2024-11-14 03:18:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:18:46,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:46,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:18:46,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:18:46,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:18:46,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:18:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 141074, now seen corresponding path program 1 times [2024-11-14 03:18:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:18:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722008982] [2024-11-14 03:18:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:46,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:18:46,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:18:46,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:18:46,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:18:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:46,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:18:46,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:46,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:18:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:18:46,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:18:46,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:18:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722008982] [2024-11-14 03:18:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722008982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:18:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023584525] [2024-11-14 03:18:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:18:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:18:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:18:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:18:46,755 INFO L87 Difference]: Start difference. First operand 1288 states and 1390 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:51,714 INFO L93 Difference]: Finished difference Result 1889 states and 2034 transitions. [2024-11-14 03:18:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:18:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:18:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:51,723 INFO L225 Difference]: With dead ends: 1889 [2024-11-14 03:18:51,724 INFO L226 Difference]: Without dead ends: 1889 [2024-11-14 03:18:51,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:18:51,725 INFO L432 NwaCegarLoop]: 1085 mSDtfsCounter, 640 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:51,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1840 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-14 03:18:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-14 03:18:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1500. [2024-11-14 03:18:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 858 states have (on average 2.0687645687645686) internal successors, (1775), 1488 states have internal predecessors, (1775), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:18:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1821 transitions. [2024-11-14 03:18:51,788 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1821 transitions. Word has length 3 [2024-11-14 03:18:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1821 transitions. [2024-11-14 03:18:51,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1821 transitions. [2024-11-14 03:18:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:18:51,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:51,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:51,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:18:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:18:51,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:18:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1437667611, now seen corresponding path program 1 times [2024-11-14 03:18:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:18:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5072231] [2024-11-14 03:18:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:51,993 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 [2024-11-14 03:18:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:18:51,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:18:51,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:18:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:52,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:18:52,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:52,235 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 [2024-11-14 03:18:52,246 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 [2024-11-14 03:18:52,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:52,361 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 [2024-11-14 03:18:52,419 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:18:52,420 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 [2024-11-14 03:18:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:18:52,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:18:52,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:18:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5072231] [2024-11-14 03:18:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5072231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:18:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70428119] [2024-11-14 03:18:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:52,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:18:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:18:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:18:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:18:52,471 INFO L87 Difference]: Start difference. First operand 1500 states and 1821 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:57,118 INFO L93 Difference]: Finished difference Result 1685 states and 2013 transitions. [2024-11-14 03:18:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:18:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:18:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:57,126 INFO L225 Difference]: With dead ends: 1685 [2024-11-14 03:18:57,127 INFO L226 Difference]: Without dead ends: 1685 [2024-11-14 03:18:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:18:57,128 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 2606 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:57,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 662 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 03:18:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-11-14 03:18:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1276. [2024-11-14 03:18:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 646 states have (on average 2.0634674922600618) internal successors, (1333), 1265 states have internal predecessors, (1333), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-14 03:18:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1377 transitions. [2024-11-14 03:18:57,164 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1377 transitions. Word has length 7 [2024-11-14 03:18:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:57,165 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1377 transitions. [2024-11-14 03:18:57,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:18:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1377 transitions. [2024-11-14 03:18:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:18:57,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:57,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:57,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 03:18:57,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:18:57,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:18:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1618023058, now seen corresponding path program 1 times [2024-11-14 03:18:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:18:57,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467098183] [2024-11-14 03:18:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:57,373 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 [2024-11-14 03:18:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:18:57,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:18:57,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:18:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:57,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:18:57,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:57,583 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 [2024-11-14 03:18:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:18:57,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:18:57,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:18:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467098183] [2024-11-14 03:18:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467098183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:57,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:57,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:18:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149895013] [2024-11-14 03:18:57,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:57,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:18:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:18:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:18:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:18:57,610 INFO L87 Difference]: Start difference. First operand 1276 states and 1377 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:00,957 INFO L93 Difference]: Finished difference Result 1610 states and 1740 transitions. [2024-11-14 03:19:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:19:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 03:19:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:00,965 INFO L225 Difference]: With dead ends: 1610 [2024-11-14 03:19:00,965 INFO L226 Difference]: Without dead ends: 1610 [2024-11-14 03:19:00,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:00,966 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 938 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:00,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1633 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:19:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-11-14 03:19:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1228. [2024-11-14 03:19:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 646 states have (on average 1.9876160990712075) internal successors, (1284), 1217 states have internal predecessors, (1284), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-14 03:19:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1328 transitions. [2024-11-14 03:19:01,006 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1328 transitions. Word has length 8 [2024-11-14 03:19:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:01,007 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1328 transitions. [2024-11-14 03:19:01,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1328 transitions. [2024-11-14 03:19:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:19:01,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:01,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:01,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:01,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1618023059, now seen corresponding path program 1 times [2024-11-14 03:19:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16084038] [2024-11-14 03:19:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:01,210 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 [2024-11-14 03:19:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:01,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:01,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:01,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:19:01,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:01,404 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 [2024-11-14 03:19:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:01,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:01,441 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16084038] [2024-11-14 03:19:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16084038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:01,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:01,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:19:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985648958] [2024-11-14 03:19:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:01,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:19:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:19:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:01,443 INFO L87 Difference]: Start difference. First operand 1228 states and 1328 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:05,522 INFO L93 Difference]: Finished difference Result 1711 states and 1847 transitions. [2024-11-14 03:19:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:19:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 03:19:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:05,529 INFO L225 Difference]: With dead ends: 1711 [2024-11-14 03:19:05,529 INFO L226 Difference]: Without dead ends: 1711 [2024-11-14 03:19:05,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:05,530 INFO L432 NwaCegarLoop]: 1422 mSDtfsCounter, 701 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:05,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 2018 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-14 03:19:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-11-14 03:19:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1483. [2024-11-14 03:19:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 909 states have (on average 1.9724972497249724) internal successors, (1793), 1470 states have internal predecessors, (1793), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-14 03:19:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1841 transitions. [2024-11-14 03:19:05,572 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1841 transitions. Word has length 8 [2024-11-14 03:19:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:05,572 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1841 transitions. [2024-11-14 03:19:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1841 transitions. [2024-11-14 03:19:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:19:05,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:05,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:05,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:05,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1222248890, now seen corresponding path program 1 times [2024-11-14 03:19:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147813336] [2024-11-14 03:19:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:05,775 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 [2024-11-14 03:19:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:05,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:05,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:05,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:19:05,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:06,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:06,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147813336] [2024-11-14 03:19:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147813336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399060356] [2024-11-14 03:19:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:19:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:06,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:19:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:06,058 INFO L87 Difference]: Start difference. First operand 1483 states and 1841 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:06,665 INFO L93 Difference]: Finished difference Result 2254 states and 2868 transitions. [2024-11-14 03:19:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:19:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:19:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:06,676 INFO L225 Difference]: With dead ends: 2254 [2024-11-14 03:19:06,676 INFO L226 Difference]: Without dead ends: 2254 [2024-11-14 03:19:06,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:06,680 INFO L432 NwaCegarLoop]: 1442 mSDtfsCounter, 634 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2628 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 [2024-11-14 03:19:06,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2628 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:19:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-11-14 03:19:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1892. [2024-11-14 03:19:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1316 states have (on average 1.958966565349544) internal successors, (2578), 1877 states have internal predecessors, (2578), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2630 transitions. [2024-11-14 03:19:06,746 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2630 transitions. Word has length 11 [2024-11-14 03:19:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:06,746 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2630 transitions. [2024-11-14 03:19:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2630 transitions. [2024-11-14 03:19:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:19:06,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:06,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:06,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 03:19:06,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:06,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:06,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1653045188, now seen corresponding path program 1 times [2024-11-14 03:19:06,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454914359] [2024-11-14 03:19:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:06,956 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 [2024-11-14 03:19:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:06,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:06,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:07,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:19:07,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:07,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:07,191 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454914359] [2024-11-14 03:19:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454914359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446514118] [2024-11-14 03:19:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:07,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:19:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:19:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:07,193 INFO L87 Difference]: Start difference. First operand 1892 states and 2630 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:07,237 INFO L93 Difference]: Finished difference Result 1796 states and 2458 transitions. [2024-11-14 03:19:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:19:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:19:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:07,248 INFO L225 Difference]: With dead ends: 1796 [2024-11-14 03:19:07,249 INFO L226 Difference]: Without dead ends: 1796 [2024-11-14 03:19:07,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:07,250 INFO L432 NwaCegarLoop]: 1247 mSDtfsCounter, 71 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:19:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-11-14 03:19:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1796. [2024-11-14 03:19:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1244 states have (on average 1.9340836012861737) internal successors, (2406), 1781 states have internal predecessors, (2406), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2458 transitions. [2024-11-14 03:19:07,304 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2458 transitions. Word has length 13 [2024-11-14 03:19:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:07,304 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2458 transitions. [2024-11-14 03:19:07,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2458 transitions. [2024-11-14 03:19:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:19:07,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:07,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:07,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:07,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 723498108, now seen corresponding path program 1 times [2024-11-14 03:19:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:07,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917818116] [2024-11-14 03:19:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:07,508 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 [2024-11-14 03:19:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:07,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:07,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:07,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:19:07,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:07,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:19:07,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:19:07,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:19:07,786 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 30 treesize of output 39 [2024-11-14 03:19:07,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:19:07,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-14 03:19:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:07,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:07,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917818116] [2024-11-14 03:19:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917818116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104503969] [2024-11-14 03:19:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:07,903 INFO L87 Difference]: Start difference. First operand 1796 states and 2458 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:09,823 INFO L93 Difference]: Finished difference Result 2454 states and 3381 transitions. [2024-11-14 03:19:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:19:09,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 03:19:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:09,834 INFO L225 Difference]: With dead ends: 2454 [2024-11-14 03:19:09,834 INFO L226 Difference]: Without dead ends: 2454 [2024-11-14 03:19:09,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:09,835 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 469 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:09,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 3526 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:19:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2024-11-14 03:19:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 1795. [2024-11-14 03:19:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1243 states have (on average 1.9340305711987127) internal successors, (2404), 1780 states have internal predecessors, (2404), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2456 transitions. [2024-11-14 03:19:09,887 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2456 transitions. Word has length 14 [2024-11-14 03:19:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:09,887 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2456 transitions. [2024-11-14 03:19:09,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2456 transitions. [2024-11-14 03:19:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:19:09,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:09,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:09,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:10,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:10,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:10,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash -237495522, now seen corresponding path program 1 times [2024-11-14 03:19:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232828309] [2024-11-14 03:19:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:10,090 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 [2024-11-14 03:19:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:10,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:10,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:10,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:19:10,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:10,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:10,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232828309] [2024-11-14 03:19:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232828309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:10,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524428864] [2024-11-14 03:19:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:19:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:19:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:10,373 INFO L87 Difference]: Start difference. First operand 1795 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:10,418 INFO L93 Difference]: Finished difference Result 1735 states and 2370 transitions. [2024-11-14 03:19:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:19:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:19:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:10,426 INFO L225 Difference]: With dead ends: 1735 [2024-11-14 03:19:10,426 INFO L226 Difference]: Without dead ends: 1735 [2024-11-14 03:19:10,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:19:10,427 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 71 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:10,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2345 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:19:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-11-14 03:19:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2024-11-14 03:19:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1207 states have (on average 1.9204639602319802) internal successors, (2318), 1720 states have internal predecessors, (2318), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2370 transitions. [2024-11-14 03:19:10,467 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2370 transitions. Word has length 18 [2024-11-14 03:19:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:10,468 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2370 transitions. [2024-11-14 03:19:10,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2370 transitions. [2024-11-14 03:19:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:19:10,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:10,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:10,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:10,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -599931305, now seen corresponding path program 1 times [2024-11-14 03:19:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429933967] [2024-11-14 03:19:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:10,670 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 [2024-11-14 03:19:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:10,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:10,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:10,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:19:10,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:10,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:10,933 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429933967] [2024-11-14 03:19:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429933967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604960880] [2024-11-14 03:19:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:10,935 INFO L87 Difference]: Start difference. First operand 1735 states and 2370 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:11,048 INFO L93 Difference]: Finished difference Result 1705 states and 2312 transitions. [2024-11-14 03:19:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:19:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-14 03:19:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:11,055 INFO L225 Difference]: With dead ends: 1705 [2024-11-14 03:19:11,055 INFO L226 Difference]: Without dead ends: 1705 [2024-11-14 03:19:11,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:11,056 INFO L432 NwaCegarLoop]: 1159 mSDtfsCounter, 48 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:11,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3451 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:19:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-14 03:19:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1705. [2024-11-14 03:19:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1191 states have (on average 1.8975650713685979) internal successors, (2260), 1690 states have internal predecessors, (2260), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2312 transitions. [2024-11-14 03:19:11,097 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2312 transitions. Word has length 20 [2024-11-14 03:19:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:11,098 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2312 transitions. [2024-11-14 03:19:11,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2312 transitions. [2024-11-14 03:19:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:19:11,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:11,101 INFO L215 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] [2024-11-14 03:19:11,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:11,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:11,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:11,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 372126437, now seen corresponding path program 1 times [2024-11-14 03:19:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:11,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387185733] [2024-11-14 03:19:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:11,307 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 [2024-11-14 03:19:11,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:11,310 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:11,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:11,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:19:11,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:11,591 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 [2024-11-14 03:19:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:11,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:11,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387185733] [2024-11-14 03:19:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387185733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605066493] [2024-11-14 03:19:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:11,726 INFO L87 Difference]: Start difference. First operand 1705 states and 2312 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:15,072 INFO L93 Difference]: Finished difference Result 1722 states and 2328 transitions. [2024-11-14 03:19:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:19:15,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 03:19:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:15,079 INFO L225 Difference]: With dead ends: 1722 [2024-11-14 03:19:15,079 INFO L226 Difference]: Without dead ends: 1722 [2024-11-14 03:19:15,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:15,080 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 828 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:15,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1538 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:19:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-11-14 03:19:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1701. [2024-11-14 03:19:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1191 states have (on average 1.890848026868178) internal successors, (2252), 1686 states have internal predecessors, (2252), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2304 transitions. [2024-11-14 03:19:15,114 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2304 transitions. Word has length 34 [2024-11-14 03:19:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:15,117 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 2304 transitions. [2024-11-14 03:19:15,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2304 transitions. [2024-11-14 03:19:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:19:15,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:15,119 INFO L215 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] [2024-11-14 03:19:15,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:15,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:15,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:15,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 372126438, now seen corresponding path program 1 times [2024-11-14 03:19:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309302496] [2024-11-14 03:19:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:15,322 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 [2024-11-14 03:19:15,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:15,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:15,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:15,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:19:15,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:15,620 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 [2024-11-14 03:19:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:15,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:15,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:15,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309302496] [2024-11-14 03:19:15,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309302496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:15,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:15,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640566947] [2024-11-14 03:19:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:15,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:15,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:15,929 INFO L87 Difference]: Start difference. First operand 1701 states and 2304 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:20,796 INFO L93 Difference]: Finished difference Result 1910 states and 2311 transitions. [2024-11-14 03:19:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:19:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 03:19:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:20,806 INFO L225 Difference]: With dead ends: 1910 [2024-11-14 03:19:20,806 INFO L226 Difference]: Without dead ends: 1910 [2024-11-14 03:19:20,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:20,807 INFO L432 NwaCegarLoop]: 1412 mSDtfsCounter, 587 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:20,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 2882 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-14 03:19:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-11-14 03:19:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1697. [2024-11-14 03:19:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1191 states have (on average 1.8841309823677581) internal successors, (2244), 1682 states have internal predecessors, (2244), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2296 transitions. [2024-11-14 03:19:20,846 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2296 transitions. Word has length 34 [2024-11-14 03:19:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:20,847 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2296 transitions. [2024-11-14 03:19:20,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:19:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2296 transitions. [2024-11-14 03:19:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 03:19:20,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:20,851 INFO L215 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] [2024-11-14 03:19:20,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 03:19:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:21,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1077510637, now seen corresponding path program 1 times [2024-11-14 03:19:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071898533] [2024-11-14 03:19:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:21,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 [2024-11-14 03:19:21,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:21,056 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:21,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:21,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:19:21,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:21,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:21,507 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071898533] [2024-11-14 03:19:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071898533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485743841] [2024-11-14 03:19:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:21,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:21,508 INFO L87 Difference]: Start difference. First operand 1697 states and 2296 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2024-11-14 03:19:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:21,611 INFO L93 Difference]: Finished difference Result 1685 states and 2276 transitions. [2024-11-14 03:19:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:19:21,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 [2024-11-14 03:19:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:21,623 INFO L225 Difference]: With dead ends: 1685 [2024-11-14 03:19:21,623 INFO L226 Difference]: Without dead ends: 1685 [2024-11-14 03:19:21,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:21,624 INFO L432 NwaCegarLoop]: 1153 mSDtfsCounter, 21 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3428 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:21,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3428 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:19:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-11-14 03:19:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1685. [2024-11-14 03:19:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1179 states have (on average 1.8863443596268024) internal successors, (2224), 1670 states have internal predecessors, (2224), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 03:19:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2276 transitions. [2024-11-14 03:19:21,656 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2276 transitions. Word has length 53 [2024-11-14 03:19:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:21,656 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2276 transitions. [2024-11-14 03:19:21,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2024-11-14 03:19:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2276 transitions. [2024-11-14 03:19:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 03:19:21,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:21,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:21,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:21,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1863155105, now seen corresponding path program 1 times [2024-11-14 03:19:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637142066] [2024-11-14 03:19:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:21,860 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 [2024-11-14 03:19:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:21,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:21,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:22,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:19:22,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:22,384 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 [2024-11-14 03:19:22,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:19:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:23,290 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 [2024-11-14 03:19:23,315 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:19:23,315 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 [2024-11-14 03:19:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:23,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:23,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:23,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637142066] [2024-11-14 03:19:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637142066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:23,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:19:23,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063628966] [2024-11-14 03:19:23,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:23,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:23,339 INFO L87 Difference]: Start difference. First operand 1685 states and 2276 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-11-14 03:19:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:26,204 INFO L93 Difference]: Finished difference Result 1658 states and 2250 transitions. [2024-11-14 03:19:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:19:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-14 03:19:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:26,211 INFO L225 Difference]: With dead ends: 1658 [2024-11-14 03:19:26,211 INFO L226 Difference]: Without dead ends: 1658 [2024-11-14 03:19:26,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:26,212 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 1520 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:26,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 776 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 03:19:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-14 03:19:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1256. [2024-11-14 03:19:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 793 states have (on average 1.8045397225725095) internal successors, (1431), 1244 states have internal predecessors, (1431), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:19:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1477 transitions. [2024-11-14 03:19:26,236 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1477 transitions. Word has length 61 [2024-11-14 03:19:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:26,237 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1477 transitions. [2024-11-14 03:19:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-11-14 03:19:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1477 transitions. [2024-11-14 03:19:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 03:19:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:26,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:26,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:26,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:26,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212380, now seen corresponding path program 1 times [2024-11-14 03:19:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257030596] [2024-11-14 03:19:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:26,444 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 [2024-11-14 03:19:26,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:26,447 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:26,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:26,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:19:26,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:26,781 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 [2024-11-14 03:19:26,807 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 [2024-11-14 03:19:26,850 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 [2024-11-14 03:19:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:26,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:26,867 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257030596] [2024-11-14 03:19:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257030596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650945420] [2024-11-14 03:19:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:19:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:19:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:26,870 INFO L87 Difference]: Start difference. First operand 1256 states and 1477 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-11-14 03:19:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:30,499 INFO L93 Difference]: Finished difference Result 1255 states and 1476 transitions. [2024-11-14 03:19:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:19:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-14 03:19:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:30,504 INFO L225 Difference]: With dead ends: 1255 [2024-11-14 03:19:30,505 INFO L226 Difference]: Without dead ends: 1255 [2024-11-14 03:19:30,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:19:30,505 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 2 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:30,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2980 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 03:19:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-14 03:19:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-14 03:19:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 793 states have (on average 1.8032786885245902) internal successors, (1430), 1243 states have internal predecessors, (1430), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:19:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1476 transitions. [2024-11-14 03:19:30,530 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1476 transitions. Word has length 66 [2024-11-14 03:19:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:30,531 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1476 transitions. [2024-11-14 03:19:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-11-14 03:19:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1476 transitions. [2024-11-14 03:19:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 03:19:30,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:30,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:30,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:30,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:30,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212381, now seen corresponding path program 1 times [2024-11-14 03:19:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000012201] [2024-11-14 03:19:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:30,734 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 [2024-11-14 03:19:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:30,736 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:30,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 03:19:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:31,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:19:31,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:31,156 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 [2024-11-14 03:19:31,185 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 [2024-11-14 03:19:31,192 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 [2024-11-14 03:19:31,275 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 [2024-11-14 03:19:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:31,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:31,307 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000012201] [2024-11-14 03:19:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000012201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090617073] [2024-11-14 03:19:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:19:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:19:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:19:31,309 INFO L87 Difference]: Start difference. First operand 1255 states and 1476 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-11-14 03:19:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:35,981 INFO L93 Difference]: Finished difference Result 1254 states and 1475 transitions. [2024-11-14 03:19:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:19:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-14 03:19:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:35,986 INFO L225 Difference]: With dead ends: 1254 [2024-11-14 03:19:35,986 INFO L226 Difference]: Without dead ends: 1254 [2024-11-14 03:19:35,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:19:35,987 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 1 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:35,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3036 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-14 03:19:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-14 03:19:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-11-14 03:19:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 792 states have (on average 1.8042929292929293) internal successors, (1429), 1242 states have internal predecessors, (1429), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:19:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1475 transitions. [2024-11-14 03:19:36,001 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1475 transitions. Word has length 66 [2024-11-14 03:19:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:36,001 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1475 transitions. [2024-11-14 03:19:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-11-14 03:19:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1475 transitions. [2024-11-14 03:19:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:19:36,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:36,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:36,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 03:19:36,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:36,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 224291427, now seen corresponding path program 1 times [2024-11-14 03:19:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629456950] [2024-11-14 03:19:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:36,208 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 [2024-11-14 03:19:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:36,210 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:36,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 03:19:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:36,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:19:36,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:36,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:19:36,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629456950] [2024-11-14 03:19:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629456950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:19:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:19:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160372176] [2024-11-14 03:19:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:19:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:19:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:36,618 INFO L87 Difference]: Start difference. First operand 1254 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-14 03:19:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:36,668 INFO L93 Difference]: Finished difference Result 1257 states and 1479 transitions. [2024-11-14 03:19:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:19:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-14 03:19:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:36,674 INFO L225 Difference]: With dead ends: 1257 [2024-11-14 03:19:36,674 INFO L226 Difference]: Without dead ends: 1257 [2024-11-14 03:19:36,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:19:36,675 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 0 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:36,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3367 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:19:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-14 03:19:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-14 03:19:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 794 states have (on average 1.8035264483627205) internal successors, (1432), 1245 states have internal predecessors, (1432), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:19:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1479 transitions. [2024-11-14 03:19:36,698 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1479 transitions. Word has length 74 [2024-11-14 03:19:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1479 transitions. [2024-11-14 03:19:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-14 03:19:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1479 transitions. [2024-11-14 03:19:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 03:19:36,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:36,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:36,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 03:19:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:19:36,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:36,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -973486415, now seen corresponding path program 1 times [2024-11-14 03:19:36,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:36,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132454391] [2024-11-14 03:19:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:36,902 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 [2024-11-14 03:19:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:36,904 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:36,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:37,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:19:37,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:37,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:37,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132454391] [2024-11-14 03:19:37,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132454391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2117875309] [2024-11-14 03:19:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:19:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:19:37,365 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:19:37,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-14 03:19:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:38,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:19:38,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:38,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:38,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2117875309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:38,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433295424] [2024-11-14 03:19:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:38,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:38,083 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:38,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:19:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:38,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:19:38,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:38,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433295424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:38,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:19:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-14 03:19:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081522452] [2024-11-14 03:19:38,562 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:19:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:19:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:19:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:19:38,564 INFO L87 Difference]: Start difference. First operand 1257 states and 1479 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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) [2024-11-14 03:19:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:38,794 INFO L93 Difference]: Finished difference Result 1269 states and 1496 transitions. [2024-11-14 03:19:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:19:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 75 [2024-11-14 03:19:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:38,800 INFO L225 Difference]: With dead ends: 1269 [2024-11-14 03:19:38,800 INFO L226 Difference]: Without dead ends: 1269 [2024-11-14 03:19:38,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:19:38,801 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 8 mSDsluCounter, 4482 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5606 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:38,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5606 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:19:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-14 03:19:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1267. [2024-11-14 03:19:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 803 states have (on average 1.8019925280199254) internal successors, (1447), 1254 states have internal predecessors, (1447), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:19:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1494 transitions. [2024-11-14 03:19:38,825 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1494 transitions. Word has length 75 [2024-11-14 03:19:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:38,826 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1494 transitions. [2024-11-14 03:19:38,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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) [2024-11-14 03:19:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1494 transitions. [2024-11-14 03:19:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-14 03:19:38,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:38,827 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:38,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-14 03:19:39,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-14 03:19:39,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 03:19:39,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:39,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:19:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash 125439459, now seen corresponding path program 2 times [2024-11-14 03:19:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:19:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795090499] [2024-11-14 03:19:39,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:19:39,430 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 [2024-11-14 03:19:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:19:39,433 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:19:39,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:19:39,953 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:19:39,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:39,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:19:39,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:40,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:40,291 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:19:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795090499] [2024-11-14 03:19:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795090499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632559596] [2024-11-14 03:19:40,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:19:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:19:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:19:40,297 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:19:40,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 03:19:42,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:19:42,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:42,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:19:42,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:42,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [632559596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:19:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76459974] [2024-11-14 03:19:42,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:19:42,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:42,244 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:42,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 03:20:25,143 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:20:25,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:25,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:20:25,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:25,172 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 [2024-11-14 03:20:25,375 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:20:25,375 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 [2024-11-14 03:20:25,428 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 [2024-11-14 03:20:25,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:20:25,802 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 [2024-11-14 03:20:25,887 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 [2024-11-14 03:20:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:20:25,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:26,108 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 03:20:26,108 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 [2024-11-14 03:20:26,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-14 03:20:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76459974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:26,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 03:20:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-14 03:20:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493639723] [2024-11-14 03:20:26,125 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 03:20:26,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 03:20:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-14 03:20:26,129 INFO L87 Difference]: Start difference. First operand 1267 states and 1494 transitions. Second operand has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 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) [2024-11-14 03:20:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:41,675 INFO L93 Difference]: Finished difference Result 1291 states and 1525 transitions. [2024-11-14 03:20:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 03:20:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 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 78 [2024-11-14 03:20:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:41,680 INFO L225 Difference]: With dead ends: 1291 [2024-11-14 03:20:41,680 INFO L226 Difference]: Without dead ends: 1287 [2024-11-14 03:20:41,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-14 03:20:41,681 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 821 mSDsluCounter, 7759 mSDsCounter, 0 mSdLazyCounter, 6820 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 8432 SdHoareTripleChecker+Invalid, 6844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:41,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 8432 Invalid, 6844 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6820 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2024-11-14 03:20:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-14 03:20:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1275. [2024-11-14 03:20:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 812 states have (on average 1.7955665024630543) internal successors, (1458), 1262 states have internal predecessors, (1458), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:20:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1505 transitions. [2024-11-14 03:20:41,706 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1505 transitions. Word has length 78 [2024-11-14 03:20:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:41,706 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1505 transitions. [2024-11-14 03:20:41,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 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) [2024-11-14 03:20:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1505 transitions. [2024-11-14 03:20:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-14 03:20:41,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:41,708 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:41,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-14 03:20:41,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 03:20:42,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-14 03:20:42,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:42,309 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:20:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -952255708, now seen corresponding path program 1 times [2024-11-14 03:20:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662507991] [2024-11-14 03:20:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:42,310 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 [2024-11-14 03:20:42,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:42,312 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:20:42,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:20:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:42,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:20:42,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:42,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:43,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662507991] [2024-11-14 03:20:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662507991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124158778] [2024-11-14 03:20:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:20:43,747 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:20:43,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 03:20:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:44,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:20:44,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:44,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:44,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2124158778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617614829] [2024-11-14 03:20:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:44,851 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:44,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:20:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:45,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:20:45,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:45,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617614829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:46,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:20:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-14 03:20:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030423606] [2024-11-14 03:20:46,437 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 03:20:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 03:20:46,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 03:20:46,440 INFO L87 Difference]: Start difference. First operand 1275 states and 1505 transitions. Second operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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) [2024-11-14 03:20:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:49,211 INFO L93 Difference]: Finished difference Result 1301 states and 1546 transitions. [2024-11-14 03:20:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:20:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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 84 [2024-11-14 03:20:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:49,215 INFO L225 Difference]: With dead ends: 1301 [2024-11-14 03:20:49,215 INFO L226 Difference]: Without dead ends: 1295 [2024-11-14 03:20:49,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:20:49,217 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 22 mSDsluCounter, 14572 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 15696 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:49,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 15696 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:20:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-14 03:20:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2024-11-14 03:20:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 830 states have (on average 1.7843373493975903) internal successors, (1481), 1280 states have internal predecessors, (1481), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:20:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1528 transitions. [2024-11-14 03:20:49,242 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1528 transitions. Word has length 84 [2024-11-14 03:20:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:49,242 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1528 transitions. [2024-11-14 03:20:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 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) [2024-11-14 03:20:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1528 transitions. [2024-11-14 03:20:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-14 03:20:49,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:49,244 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:49,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 03:20:49,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:20:49,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 03:20:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:49,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:20:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1748744796, now seen corresponding path program 2 times [2024-11-14 03:20:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91685285] [2024-11-14 03:20:49,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:20:49,846 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 [2024-11-14 03:20:49,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:49,848 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:20:49,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:20:50,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:20:50,541 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:50,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:20:50,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:51,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:53,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91685285] [2024-11-14 03:20:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91685285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [526899685] [2024-11-14 03:20:53,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:20:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:20:53,548 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:20:53,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 03:20:55,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:20:55,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:20:55,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:20:55,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:56,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:20:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [526899685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:20:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303771492] [2024-11-14 03:20:56,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:20:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:56,474 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:56,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 03:21:29,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:21:29,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:21:29,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:21:29,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:29,190 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 [2024-11-14 03:21:29,425 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 [2024-11-14 03:21:29,443 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:21:29,443 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 [2024-11-14 03:21:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:21:29,601 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 [2024-11-14 03:21:30,138 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 [2024-11-14 03:21:30,147 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 [2024-11-14 03:21:31,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:21:31,069 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 [2024-11-14 03:21:31,076 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 [2024-11-14 03:21:31,311 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 [2024-11-14 03:21:31,317 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 [2024-11-14 03:21:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-14 03:21:31,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:32,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2925) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2925) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-14 03:21:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303771492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:32,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 03:21:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-14 03:21:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743162906] [2024-11-14 03:21:32,605 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-14 03:21:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-14 03:21:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-14 03:21:32,609 INFO L87 Difference]: Start difference. First operand 1293 states and 1528 transitions. Second operand has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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) [2024-11-14 03:22:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:23,961 INFO L93 Difference]: Finished difference Result 1344 states and 1609 transitions. [2024-11-14 03:22:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 03:22:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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 96 [2024-11-14 03:22:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:23,966 INFO L225 Difference]: With dead ends: 1344 [2024-11-14 03:22:23,966 INFO L226 Difference]: Without dead ends: 1336 [2024-11-14 03:22:23,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3100, Invalid=14459, Unknown=1, NotChecked=262, Total=17822 [2024-11-14 03:22:23,972 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 802 mSDsluCounter, 20165 mSDsCounter, 0 mSdLazyCounter, 15664 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 20908 SdHoareTripleChecker+Invalid, 15747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 15664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:23,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 20908 Invalid, 15747 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [83 Valid, 15664 Invalid, 0 Unknown, 0 Unchecked, 39.9s Time] [2024-11-14 03:22:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-14 03:22:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1326. [2024-11-14 03:22:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 864 states have (on average 1.7615740740740742) internal successors, (1522), 1313 states have internal predecessors, (1522), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:22:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1569 transitions. [2024-11-14 03:22:24,007 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1569 transitions. Word has length 96 [2024-11-14 03:22:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:24,007 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1569 transitions. [2024-11-14 03:22:24,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 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) [2024-11-14 03:22:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1569 transitions. [2024-11-14 03:22:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 03:22:24,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:24,009 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:24,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:22:24,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 03:22:24,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 03:22:24,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:22:24,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:22:24,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash 588574952, now seen corresponding path program 1 times [2024-11-14 03:22:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154286124] [2024-11-14 03:22:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:24,612 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 [2024-11-14 03:22:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:24,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:22:24,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:22:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:25,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:22:25,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:25,863 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 [2024-11-14 03:22:26,116 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:22:26,116 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 [2024-11-14 03:22:26,166 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 [2024-11-14 03:22:26,341 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 [2024-11-14 03:22:27,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:27,829 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 [2024-11-14 03:22:27,993 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:27,994 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 [2024-11-14 03:22:28,034 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 [2024-11-14 03:22:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:22:28,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:28,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (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_3350) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:22:28,753 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3396))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3350)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:22:28,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:22:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154286124] [2024-11-14 03:22:28,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154286124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766990239] [2024-11-14 03:22:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:28,756 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:22:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:22:28,758 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:22:28,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 03:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:31,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:22:31,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:31,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 7 [2024-11-14 03:22:31,994 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:22:31,994 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 [2024-11-14 03:22:32,024 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 [2024-11-14 03:22:32,110 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 [2024-11-14 03:22:33,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:33,443 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 [2024-11-14 03:22:33,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:33,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:22:33,584 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 [2024-11-14 03:22:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:22:33,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:33,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3820 (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~mem38#1.base| v_ArrVal_3820) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 03:22:33,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3820 (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_3820) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2024-11-14 03:22:34,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3866 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3866))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3820)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:22:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [766990239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018610308] [2024-11-14 03:22:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:34,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:34,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:34,123 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:34,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 03:22:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:34,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:22:34,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:34,861 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 [2024-11-14 03:22:35,064 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:22:35,065 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 [2024-11-14 03:22:35,101 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 [2024-11-14 03:22:35,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:35,989 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 [2024-11-14 03:22:36,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:36,243 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 [2024-11-14 03:22:36,282 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 [2024-11-14 03:22:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:22:36,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:37,033 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 03:22:37,033 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 [2024-11-14 03:22:37,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3350 (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~mem36#1.base| v_ArrVal_4335))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3350)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-14 03:22:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018610308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:37,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:22:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-14 03:22:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942543301] [2024-11-14 03:22:37,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:22:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:22:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=348, Unknown=14, NotChecked=258, Total=702 [2024-11-14 03:22:37,050 INFO L87 Difference]: Start difference. First operand 1326 states and 1569 transitions. Second operand has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:22:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:55,380 INFO L93 Difference]: Finished difference Result 1335 states and 1578 transitions. [2024-11-14 03:22:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:22:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-14 03:22:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:55,385 INFO L225 Difference]: With dead ends: 1335 [2024-11-14 03:22:55,386 INFO L226 Difference]: Without dead ends: 1335 [2024-11-14 03:22:55,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=459, Unknown=14, NotChecked=294, Total=870 [2024-11-14 03:22:55,388 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 796 mSDsluCounter, 6803 mSDsCounter, 0 mSdLazyCounter, 7162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 7175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:55,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 7475 Invalid, 7175 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 7162 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2024-11-14 03:22:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2024-11-14 03:22:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1325. [2024-11-14 03:22:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 864 states have (on average 1.7604166666666667) internal successors, (1521), 1312 states have internal predecessors, (1521), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:22:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1568 transitions. [2024-11-14 03:22:55,412 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1568 transitions. Word has length 121 [2024-11-14 03:22:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:55,413 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1568 transitions. [2024-11-14 03:22:55,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:22:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1568 transitions. [2024-11-14 03:22:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 03:22:55,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:55,415 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:55,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:22:55,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 03:22:55,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2024-11-14 03:22:56,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:22:56,016 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:22:56,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:56,016 INFO L85 PathProgramCache]: Analyzing trace with hash 588574953, now seen corresponding path program 1 times [2024-11-14 03:22:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721296884] [2024-11-14 03:22:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:56,017 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 [2024-11-14 03:22:56,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:56,019 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:22:56,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:22:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:57,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 03:22:57,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:57,275 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 [2024-11-14 03:22:57,459 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:22:57,459 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 [2024-11-14 03:22:57,470 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 [2024-11-14 03:22:57,507 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 [2024-11-14 03:22:57,513 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 [2024-11-14 03:22:57,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 22 treesize of output 10 [2024-11-14 03:22:57,701 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 [2024-11-14 03:22:58,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:58,875 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 [2024-11-14 03:22:58,882 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 [2024-11-14 03:22:59,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:59,027 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 [2024-11-14 03:22:59,042 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 [2024-11-14 03:22:59,068 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 [2024-11-14 03:22:59,074 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 [2024-11-14 03:22:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:22:59,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:59,490 WARN L851 $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_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:23:01,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4897) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4898))) (let ((.cse2 (select (select .cse3 |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~mem36#1.base| v_ArrVal_4897) .cse2 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:23:01,449 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:23:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721296884] [2024-11-14 03:23:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721296884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [285980376] [2024-11-14 03:23:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:01,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:23:01,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:23:01,451 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:23:01,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 03:24:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:49,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 03:24:49,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:49,095 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 [2024-11-14 03:24:49,353 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:24:49,353 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 [2024-11-14 03:24:49,361 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 [2024-11-14 03:24:49,374 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 [2024-11-14 03:24:49,380 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 [2024-11-14 03:24:49,469 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 [2024-11-14 03:24:49,476 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 [2024-11-14 03:24:50,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:50,529 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 [2024-11-14 03:24:50,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 [2024-11-14 03:24:50,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:50,650 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 [2024-11-14 03:24:50,657 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 [2024-11-14 03:24:50,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 31 treesize of output 13 [2024-11-14 03:24:50,698 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 [2024-11-14 03:24:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:24:50,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:50,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:24:50,825 WARN L851 $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_5368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-14 03:24:52,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5461 (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_5460) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5461))) (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_5460) .cse2 v_ArrVal_5368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:24:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [285980376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541478134] [2024-11-14 03:24:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:24:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:24:52,713 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:24:52,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 03:24:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:53,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 03:24:53,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:53,662 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 [2024-11-14 03:24:53,843 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 [2024-11-14 03:24:53,862 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:24:53,862 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 [2024-11-14 03:24:53,878 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 [2024-11-14 03:24:53,884 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 [2024-11-14 03:24:53,983 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 [2024-11-14 03:24:53,989 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 [2024-11-14 03:24:54,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:54,934 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 [2024-11-14 03:24:54,943 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 [2024-11-14 03:24:55,061 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:55,062 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 [2024-11-14 03:24:55,070 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 [2024-11-14 03:24:55,119 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 [2024-11-14 03:24:55,127 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 [2024-11-14 03:24:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:24:55,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:57,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6024 (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_6024) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6023))) (let ((.cse2 (select (select .cse3 |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~mem36#1.base| v_ArrVal_6024) .cse2 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:24:57,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541478134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:57,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:24:57,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-14 03:24:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827787624] [2024-11-14 03:24:57,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:24:57,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:24:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:24:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:24:57,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=125, Unknown=12, NotChecked=162, Total=342 [2024-11-14 03:24:57,156 INFO L87 Difference]: Start difference. First operand 1325 states and 1568 transitions. Second operand has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:25:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:25:12,853 INFO L93 Difference]: Finished difference Result 1332 states and 1575 transitions. [2024-11-14 03:25:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:25:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2024-11-14 03:25:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:25:12,856 INFO L225 Difference]: With dead ends: 1332 [2024-11-14 03:25:12,856 INFO L226 Difference]: Without dead ends: 1332 [2024-11-14 03:25:12,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=242, Unknown=13, NotChecked=222, Total=552 [2024-11-14 03:25:12,857 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 748 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 5290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 5297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:25:12,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 4076 Invalid, 5297 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 5290 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-14 03:25:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-14 03:25:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1324. [2024-11-14 03:25:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 864 states have (on average 1.7592592592592593) internal successors, (1520), 1311 states have internal predecessors, (1520), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:25:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1567 transitions. [2024-11-14 03:25:12,875 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1567 transitions. Word has length 121 [2024-11-14 03:25:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:25:12,875 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1567 transitions. [2024-11-14 03:25:12,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:25:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1567 transitions. [2024-11-14 03:25:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 03:25:12,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:25:12,877 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:25:12,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-14 03:25:13,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-14 03:25:13,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-14 03:25:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:25:13,478 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:25:13,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:25:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2114678294, now seen corresponding path program 1 times [2024-11-14 03:25:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:25:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372731675] [2024-11-14 03:25:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:13,479 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 [2024-11-14 03:25:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:25:13,484 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:25:13,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:25:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:14,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:25:14,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:14,639 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 [2024-11-14 03:25:14,856 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:25:14,856 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 [2024-11-14 03:25:14,889 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 [2024-11-14 03:25:15,012 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 [2024-11-14 03:25:16,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:25:16,195 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 [2024-11-14 03:25:16,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:25:16,342 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 [2024-11-14 03:25:16,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:25:16,455 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 [2024-11-14 03:25:16,485 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 [2024-11-14 03:25:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:25:16,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:25:16,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6464 (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_6464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:25:16,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6464 (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~mem38#1.base| v_ArrVal_6463))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6464)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:25:16,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6464 (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_6463))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6464)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:25:17,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6510))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6463)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6464)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:25:17,173 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:25:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372731675] [2024-11-14 03:25:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372731675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:25:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873059666] [2024-11-14 03:25:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:25:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:25:17,176 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:25:17,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 03:26:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:03,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:26:03,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:03,769 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 [2024-11-14 03:26:03,998 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:26:03,998 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 [2024-11-14 03:26:04,019 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 [2024-11-14 03:26:04,100 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 [2024-11-14 03:26:05,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:05,184 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 [2024-11-14 03:26:05,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:05,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:26:05,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:05,317 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 [2024-11-14 03:26:05,345 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 [2024-11-14 03:26:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:26:05,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:05,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6950 (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~mem39#1.base| v_ArrVal_6950) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 03:26:05,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6950) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-14 03:26:05,403 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6950 (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~mem38#1.base| v_ArrVal_6949))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6950)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:05,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6949))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6950)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:26:05,970 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6996))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6949)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6950)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [873059666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665458608] [2024-11-14 03:26:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:26:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:26:05,977 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:26:05,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 03:26:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:06,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:26:06,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:06,961 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 [2024-11-14 03:26:07,127 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:26:07,127 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 [2024-11-14 03:26:07,166 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 [2024-11-14 03:26:07,671 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:07,671 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 [2024-11-14 03:26:07,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:07,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 31 treesize of output 32 [2024-11-14 03:26:07,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:07,927 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 [2024-11-14 03:26:08,036 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 [2024-11-14 03:26:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:26:08,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:08,084 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 03:26:08,084 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 [2024-11-14 03:26:08,190 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-14 03:26:08,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7434)) (.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_7435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-14 03:26:08,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7434))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 03:26:08,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7481))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7434)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:26:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665458608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:08,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:26:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-14 03:26:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818712066] [2024-11-14 03:26:08,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:26:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:26:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:26:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:26:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=419, Unknown=32, NotChecked=702, Total=1260 [2024-11-14 03:26:08,776 INFO L87 Difference]: Start difference. First operand 1324 states and 1567 transitions. Second operand has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:26:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:19,670 INFO L93 Difference]: Finished difference Result 1333 states and 1576 transitions. [2024-11-14 03:26:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:26:19,671 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-11-14 03:26:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:19,676 INFO L225 Difference]: With dead ends: 1333 [2024-11-14 03:26:19,676 INFO L226 Difference]: Without dead ends: 1333 [2024-11-14 03:26:19,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=116, Invalid=455, Unknown=33, NotChecked=728, Total=1332 [2024-11-14 03:26:19,681 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 834 mSDsluCounter, 4301 mSDsCounter, 0 mSdLazyCounter, 4492 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 4974 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:19,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 4974 Invalid, 4539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 4492 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-14 03:26:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-11-14 03:26:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1323. [2024-11-14 03:26:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 864 states have (on average 1.7581018518518519) internal successors, (1519), 1310 states have internal predecessors, (1519), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:26:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1566 transitions. [2024-11-14 03:26:19,754 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1566 transitions. Word has length 124 [2024-11-14 03:26:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:19,755 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1566 transitions. [2024-11-14 03:26:19,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 20 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:26:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1566 transitions. [2024-11-14 03:26:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 03:26:19,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:19,758 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:19,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 03:26:19,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:26:20,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-14 03:26:20,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:26:20,359 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:26:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2114678293, now seen corresponding path program 1 times [2024-11-14 03:26:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:26:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018342580] [2024-11-14 03:26:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:20,362 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 [2024-11-14 03:26:20,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:26:20,364 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:26:20,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:26:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:21,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-14 03:26:21,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:21,814 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 [2024-11-14 03:26:21,969 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:26:21,970 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 [2024-11-14 03:26:21,980 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 [2024-11-14 03:26:22,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 [2024-11-14 03:26:22,011 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 [2024-11-14 03:26:22,146 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 [2024-11-14 03:26:22,152 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 [2024-11-14 03:26:22,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:22,978 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 [2024-11-14 03:26:22,992 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 [2024-11-14 03:26:23,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:23,125 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 [2024-11-14 03:26:23,132 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 [2024-11-14 03:26:23,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:23,273 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 [2024-11-14 03:26:23,280 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 [2024-11-14 03:26:23,313 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 [2024-11-14 03:26:23,319 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 [2024-11-14 03:26:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:26:23,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:23,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-14 03:26:23,558 WARN L851 $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_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-14 03:26:23,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7966))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7967) .cse0 v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7967) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-14 03:26:23,700 WARN L851 $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_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7967) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7966))) (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_7967) .cse3 v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 03:26:27,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (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_8060))) (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_8061) .cse1 v_ArrVal_7967) (select (select (store .cse2 .cse1 v_ArrVal_7966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7968))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7966 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8060))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7966))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8061) .cse4 v_ArrVal_7967) .cse5 v_ArrVal_7968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 03:26:27,401 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:26:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018342580] [2024-11-14 03:26:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018342580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1264173238] [2024-11-14 03:26:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:27,401 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:26:27,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:26:27,403 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:26:27,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-14 03:27:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:15,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 03:27:15,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:27:15,682 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 [2024-11-14 03:27:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:27:16,171 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:27:16,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 03:27:16,194 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 [2024-11-14 03:27:16,213 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 [2024-11-14 03:27:16,367 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 [2024-11-14 03:27:16,377 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 [2024-11-14 03:27:18,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:18,102 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 [2024-11-14 03:27:18,113 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 [2024-11-14 03:27:18,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:18,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:27:18,304 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 [2024-11-14 03:27:18,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:18,468 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 [2024-11-14 03:27:18,480 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 [2024-11-14 03:27:18,547 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 [2024-11-14 03:27:18,557 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 [2024-11-14 03:27:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:27:18,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:27:18,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8549) |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~mem39#1.base| v_ArrVal_8548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-14 03:27:18,733 WARN L851 $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_8549 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:27:18,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8546))) (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~mem38#1.base| v_ArrVal_8547) .cse0 v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8547) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-14 03:27:18,864 WARN L851 $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_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8547) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8546))) (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_8547) .cse3 v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 03:27:21,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8641))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8546))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8640) .cse0 v_ArrVal_8547) .cse1 v_ArrVal_8549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8641))) (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~mem36#1.base| v_ArrVal_8640) .cse6 v_ArrVal_8547) (select (select (store .cse7 .cse6 v_ArrVal_8546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8549))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-14 03:27:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1264173238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:27:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597639532] [2024-11-14 03:27:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:27:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:27:21,271 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:27:21,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 03:27:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:22,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-14 03:27:22,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:27:22,455 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 [2024-11-14 03:27:22,970 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:27:22,970 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 [2024-11-14 03:27:22,987 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 [2024-11-14 03:27:23,010 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 [2024-11-14 03:27:23,032 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 [2024-11-14 03:27:23,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 03:27:23,199 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 [2024-11-14 03:27:25,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:25,109 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 [2024-11-14 03:27:25,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 30 treesize of output 13 [2024-11-14 03:27:25,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:25,314 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 [2024-11-14 03:27:25,326 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 [2024-11-14 03:27:25,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:25,477 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 [2024-11-14 03:27:25,488 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 [2024-11-14 03:27:25,558 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 [2024-11-14 03:27:25,569 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 [2024-11-14 03:27:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:27:25,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:27:25,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:27:25,746 WARN L851 $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_9129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-14 03:27:25,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9127) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9126))) (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~mem38#1.base| v_ArrVal_9127) .cse2 v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:27:25,968 WARN L851 $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_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9127) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9126))) (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_9127) .cse3 v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 03:27:28,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9221))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9126))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9220) .cse0 v_ArrVal_9127) .cse1 v_ArrVal_9128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9221))) (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~mem36#1.base| v_ArrVal_9220) .cse6 v_ArrVal_9127) (select (select (store .cse7 .cse6 v_ArrVal_9126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9128))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-14 03:27:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597639532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:27:28,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:27:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-14 03:27:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507105771] [2024-11-14 03:27:28,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:27:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:27:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:27:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:27:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=139, Unknown=15, NotChecked=540, Total=756 [2024-11-14 03:27:28,838 INFO L87 Difference]: Start difference. First operand 1323 states and 1566 transitions. Second operand has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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) [2024-11-14 03:27:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:52,842 INFO L93 Difference]: Finished difference Result 1330 states and 1573 transitions. [2024-11-14 03:27:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:27:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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 124 [2024-11-14 03:27:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:52,847 INFO L225 Difference]: With dead ends: 1330 [2024-11-14 03:27:52,847 INFO L226 Difference]: Without dead ends: 1330 [2024-11-14 03:27:52,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 368 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=100, Invalid=287, Unknown=15, NotChecked=720, Total=1122 [2024-11-14 03:27:52,849 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 746 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 4567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:52,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 3673 Invalid, 4567 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2024-11-14 03:27:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-14 03:27:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1322. [2024-11-14 03:27:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 864 states have (on average 1.7569444444444444) internal successors, (1518), 1309 states have internal predecessors, (1518), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:27:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1565 transitions. [2024-11-14 03:27:52,870 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1565 transitions. Word has length 124 [2024-11-14 03:27:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:52,870 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1565 transitions. [2024-11-14 03:27:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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) [2024-11-14 03:27:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1565 transitions. [2024-11-14 03:27:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 03:27:52,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:52,872 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:52,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 03:27:53,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:27:53,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-14 03:27:53,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:27:53,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:27:53,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 199644367, now seen corresponding path program 1 times [2024-11-14 03:27:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:27:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818617836] [2024-11-14 03:27:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:53,475 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 [2024-11-14 03:27:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:27:53,477 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:27:53,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:27:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:54,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:27:54,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:27:54,966 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 [2024-11-14 03:27:55,462 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:27:55,463 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 [2024-11-14 03:27:55,549 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 [2024-11-14 03:27:55,802 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 [2024-11-14 03:27:57,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:57,977 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 [2024-11-14 03:27:58,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:58,228 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 [2024-11-14 03:27:58,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:58,468 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 [2024-11-14 03:27:58,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:58,718 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 [2024-11-14 03:27:58,807 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 [2024-11-14 03:27:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:27:58,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:27:59,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9677 (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_9677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:27:59,329 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9676 (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~mem39#1.base| v_ArrVal_9676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:27:59,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9676 (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_9676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:27:59,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:27:59,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:28:00,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9675 (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~mem36#1.base| v_ArrVal_9723))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9675)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 03:28:00,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:28:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818617836] [2024-11-14 03:28:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818617836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:28:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [902301100] [2024-11-14 03:28:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:00,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:28:00,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:28:00,278 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:28:00,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2024-11-14 03:29:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:07,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 03:29:07,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:07,683 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 [2024-11-14 03:29:08,173 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:29:08,173 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 [2024-11-14 03:29:08,211 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 [2024-11-14 03:29:08,367 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 [2024-11-14 03:29:10,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:10,367 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 [2024-11-14 03:29:10,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:10,529 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 [2024-11-14 03:29:10,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:10,680 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 [2024-11-14 03:29:10,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:10,845 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 [2024-11-14 03:29:10,933 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 [2024-11-14 03:29:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:29:10,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:10,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (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~mem40#1.base| v_ArrVal_10179) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-14 03:29:11,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (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_10179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:29:11,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (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~mem39#1.base| v_ArrVal_10178))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10179)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:29:11,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (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_10178))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10179)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:29:11,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10177))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10178)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10179)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:29:11,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10177))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10178)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10179)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:29:11,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10225))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10177)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10178)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10179)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:29:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [902301100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33644903] [2024-11-14 03:29:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:11,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:29:11,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:29:11,928 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:29:11,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-14 03:29:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:13,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:29:13,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:13,111 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 [2024-11-14 03:29:13,620 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:29:13,621 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 [2024-11-14 03:29:13,714 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 [2024-11-14 03:29:14,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:14,741 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 [2024-11-14 03:29:14,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:14,929 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 [2024-11-14 03:29:15,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:15,124 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 [2024-11-14 03:29:15,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:15,330 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 [2024-11-14 03:29:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 03:29:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:29:15,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:15,582 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 03:29:15,582 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 [2024-11-14 03:29:15,598 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem40#1.base|)) is different from false [2024-11-14 03:29:15,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (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_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-14 03:29:15,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10679)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-14 03:29:15,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10679))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:29:15,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10678))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10679)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 03:29:15,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10678))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10679)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:29:16,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10726 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10726))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10678)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10679)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 03:29:16,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33644903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:16,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:29:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2024-11-14 03:29:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794816193] [2024-11-14 03:29:16,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:29:16,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 03:29:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:29:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 03:29:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=476, Unknown=28, NotChecked=1260, Total=1892 [2024-11-14 03:29:16,669 INFO L87 Difference]: Start difference. First operand 1322 states and 1565 transitions. Second operand has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:29:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:48,904 INFO L93 Difference]: Finished difference Result 1331 states and 1574 transitions. [2024-11-14 03:29:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:29:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-14 03:29:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:48,909 INFO L225 Difference]: With dead ends: 1331 [2024-11-14 03:29:48,909 INFO L226 Difference]: Without dead ends: 1331 [2024-11-14 03:29:48,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=515, Unknown=28, NotChecked=1300, Total=1980 [2024-11-14 03:29:48,910 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 790 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 6919 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 7748 SdHoareTripleChecker+Invalid, 6930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:48,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 7748 Invalid, 6930 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 6919 Invalid, 0 Unknown, 0 Unchecked, 31.9s Time] [2024-11-14 03:29:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-14 03:29:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1321. [2024-11-14 03:29:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 864 states have (on average 1.755787037037037) internal successors, (1517), 1308 states have internal predecessors, (1517), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-14 03:29:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1564 transitions. [2024-11-14 03:29:48,931 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1564 transitions. Word has length 127 [2024-11-14 03:29:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:48,932 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1564 transitions. [2024-11-14 03:29:48,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:29:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1564 transitions. [2024-11-14 03:29:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-14 03:29:48,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:48,934 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:29:48,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2024-11-14 03:29:49,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 03:29:49,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-11-14 03:29:49,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:29:49,536 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-14 03:29:49,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash 199644368, now seen corresponding path program 1 times [2024-11-14 03:29:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:29:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522126434] [2024-11-14 03:29:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:49,538 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 [2024-11-14 03:29:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:29:49,540 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 03:29:49,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 03:29:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:51,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-14 03:29:51,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:51,180 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 [2024-11-14 03:29:51,659 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:29:51,660 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 [2024-11-14 03:29:51,676 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 [2024-11-14 03:29:51,735 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 [2024-11-14 03:29:51,745 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 [2024-11-14 03:29:52,017 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 [2024-11-14 03:29:52,027 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 [2024-11-14 03:29:53,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:53,769 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 [2024-11-14 03:29:53,780 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 [2024-11-14 03:29:54,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:54,046 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 [2024-11-14 03:29:54,057 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 [2024-11-14 03:29:54,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:54,307 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 [2024-11-14 03:29:54,319 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 [2024-11-14 03:29:54,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:54,578 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 [2024-11-14 03:29:54,589 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 [2024-11-14 03:29:54,663 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 [2024-11-14 03:29:54,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:29:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:29:54,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:55,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:29:55,119 WARN L851 $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_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-14 03:29:55,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11229))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11228) .cse0 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11228) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-14 03:29:55,267 WARN L851 $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_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11229))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11228) .cse1 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11228) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-14 03:29:55,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11226))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11229))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11227) .cse0 v_ArrVal_11228) .cse1 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11226))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11227) .cse6 v_ArrVal_11228) (select (select (store .cse7 .cse6 v_ArrVal_11229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11230))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-14 03:30:01,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11323))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11226))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11229))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11322) .cse0 v_ArrVal_11227) .cse1 v_ArrVal_11228) .cse2 v_ArrVal_11230) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11229 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11323))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11226))) (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~mem36#1.base| v_ArrVal_11322) .cse8 v_ArrVal_11227) .cse9 v_ArrVal_11228) (select (select (store .cse10 .cse9 v_ArrVal_11229) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11230))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-14 03:30:01,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:30:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522126434] [2024-11-14 03:30:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522126434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:30:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679961751] [2024-11-14 03:30:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:30:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:30:01,822 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:30:01,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2024-11-14 03:30:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:59,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-14 03:30:59,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:59,261 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 [2024-11-14 03:31:00,722 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:31:00,723 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 [2024-11-14 03:31:00,769 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 [2024-11-14 03:31:00,820 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 [2024-11-14 03:31:00,868 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 [2024-11-14 03:31:01,274 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 [2024-11-14 03:31:01,303 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 [2024-11-14 03:31:06,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:06,001 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 [2024-11-14 03:31:06,028 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 [2024-11-14 03:31:06,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:06,503 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 [2024-11-14 03:31:06,529 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 [2024-11-14 03:31:06,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:06,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:31:06,938 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 [2024-11-14 03:31:07,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:07,313 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 [2024-11-14 03:31:07,339 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 [2024-11-14 03:31:07,529 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 [2024-11-14 03:31:07,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 9 treesize of output 3 [2024-11-14 03:31:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:31:07,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:08,524 WARN L851 $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_11827 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:31:08,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11825))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11826) .cse0 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11826) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-14 03:31:08,846 WARN L851 $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_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11826) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11825))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11826) .cse3 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 03:31:09,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11824))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11825))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11823) .cse0 v_ArrVal_11826) .cse1 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11824))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11823) .cse6 v_ArrVal_11826) (select (select (store .cse7 .cse6 v_ArrVal_11825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11827))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-14 03:31:10,476 WARN L851 $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_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11824))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11823) .cse2 v_ArrVal_11826) (select (select (store .cse3 .cse2 v_ArrVal_11825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11827))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11824))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11825))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11823) .cse5 v_ArrVal_11826) .cse6 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-14 03:31:14,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11919 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11919))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11824))) (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~mem36#1.base| v_ArrVal_11920) .cse1 v_ArrVal_11823) .cse2 v_ArrVal_11826) (select (select (store .cse3 .cse2 v_ArrVal_11825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11827))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11919 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11825 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11919))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11824))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11825))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11920) .cse6 v_ArrVal_11823) .cse7 v_ArrVal_11826) .cse8 v_ArrVal_11827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_11828) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-14 03:31:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679961751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:14,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499410578] [2024-11-14 03:31:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:14,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:14,743 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:14,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1b66e4d-9d56-4511-b9c1-d7967ec72bfa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-11-14 03:31:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:16,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 03:31:16,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:17,261 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 [2024-11-14 03:31:17,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:31:17,386 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 [2024-11-14 03:31:17,440 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 [2024-11-14 03:31:17,465 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 [2024-11-14 03:31:17,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 22 treesize of output 10 [2024-11-14 03:31:17,929 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 [2024-11-14 03:31:22,820 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:22,820 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 [2024-11-14 03:31:22,848 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 [2024-11-14 03:31:23,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:23,292 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 [2024-11-14 03:31:23,317 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 [2024-11-14 03:31:23,705 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:23,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 62 treesize of output 57 [2024-11-14 03:31:23,732 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 [2024-11-14 03:31:24,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:24,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:31:24,149 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 [2024-11-14 03:31:24,345 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 [2024-11-14 03:31:24,370 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 [2024-11-14 03:31:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-14 03:31:24,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:24,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-14 03:31:24,742 WARN L851 $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_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:31:24,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12421))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12422) .cse0 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12422) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-14 03:31:25,144 WARN L851 $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_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12421))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12422) .cse1 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12422) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-14 03:31:25,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12420))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12419) .cse1 v_ArrVal_12422) (select (select (store .cse2 .cse1 v_ArrVal_12421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12423))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12420))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12421))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12419) .cse4 v_ArrVal_12422) .cse5 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 03:31:27,766 WARN L851 $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_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12420))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12419) .cse2 v_ArrVal_12422) (select (select (store .cse3 .cse2 v_ArrVal_12421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12423))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12420))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12421))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12419) .cse5 v_ArrVal_12422) .cse6 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-14 03:31:34,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12516))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12420))) (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~mem36#1.base| v_ArrVal_12515) .cse1 v_ArrVal_12419) .cse2 v_ArrVal_12422) (select (select (store .cse3 .cse2 v_ArrVal_12421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12423))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12516))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12420))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12421))) (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~mem36#1.base| v_ArrVal_12515) .cse6 v_ArrVal_12419) .cse7 v_ArrVal_12422) .cse8 v_ArrVal_12423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_12424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-14 03:31:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499410578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:34,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-14 03:31:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913818321] [2024-11-14 03:31:34,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:31:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:31:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:31:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=195, Unknown=37, NotChecked=874, Total=1190 [2024-11-14 03:31:34,225 INFO L87 Difference]: Start difference. First operand 1321 states and 1564 transitions. Second operand has 12 states, 10 states have (on average 8.7) internal successors, (87), 12 states have internal predecessors, (87), 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)